Publisher's Synopsis
"Parallel Algorithms for Regular Architectures" offers a collection of optimal and efficient algorithms for solving problems on sets of processors configured as a mesh or a pyramid. In addition, it provides insights into the parallel algorithm design process.;The algorithms can be adapted to multiprocessor machines with varying degrees of granularity and a variety of processor configurations. They can be utilized inside a single VLSI chip, on special-purpose parallel machines, on intermediate-size machines, or on large parallel computers, such as the IBM SP2, Cray T3D/T3E, Intel Paragon, or MasPar MP1/MP2, that are routinely used for solving complex scientific and engineering problems.;Basic algorithms, such as sorting, matrix multiplication and parallel prefix, are described, as are algorithms to solve fundamental problems in image processing, computational geometry and graph theory. A consistent approach, based on algorithmic techniques, shows how to exploit the use of data movement operations. Since many of the algorithms were originally created by the authors using these techniques, the reader can actually see how parallel algorithms are developed by following the design process.;"Parallel Algorithms for Regular Architectures" should be useful to researchers as well as practitioners who need to implement parallel programmes. The algorithms and operations can be incorporated into a variety of applications, and the design and analysis techniques can be exploited in an even greater range.
