Take advantage of the power of parallel computers with this comprehensive introduction to methods for the design, implementation, and analysis of parallel algorithms. You'll examine many important core topics, including sorting and graph algorithms, discrete optimization techniques, and scientific computing applications, as you consider parallel algorithms for realistic machine models. Features: presents parallel algorithms as a small set of basic data communication operations in order to simplify their design and increase understanding; emphasizes practical issues of performance, efficiency, and scalability; provides a self-contained discussion of the basic concepts of parallel computer architectures; covers algorithms for scientific computation, such as dense and sparse matrix computations, linear system solving, finite elements, and FFT; discusses algorithms for combinatorial optimization, including branch-and-bound, heuristic search, and dynamic programming; incorporates illustrative examples of parallel programs for commercially available computers; and contains extensive figures and examples that illustrate the workings of algorithms on different architectures.Parallel Computing, 11:37-53, 1989. [CGLN84] E. Chu, J. A. George, J. W.-H. Liu, and E. G.-Y. Ng. Users guide for SPARSPAK-A: Waterloo sparse linear equations package. ... Parallel direct solution of sparse linear system of equations.
|Title||:||Introduction to parallel computing|
|Publisher||:||Addison Wesley - 1994|