Parallel Algorithms for Regular Architectures offers a collection of optimal and efficient algorithms to solve problems on the set of processors configured as a mesh or a pyramid. basic algorithms, such as sorting, matrix multiplication, and parallel prefix, is described, as well as algorithms to solve fundamental problems in image processing, computational geometry, and graph theory. Since many of the algorithm was originally created by the authors using these techniques, the reader can actually see how an efficient parallel algorithm developed by following the design process. Parallel Algorithms for Regular Architectures will be useful for researchers and practitioners who need to implement a parallel program efficient.