This book is a well written introduction to parallel algorithms and the most popular network architectures. It was developed on the basis of seminar papers and lecture notes, and is based on many years of teaching at the MIT. The book contains the latest results and techniques and can well be used for early graduate courses. An overwhelming number of more than 750 exercises contains about 250 designated as the most valuable. Others are posed as difficult or as research problems. The contents itself is organized in three chapters according to the network architecture: arrays and trees for Chapter 1 (117 pages), meshes of trees for Chapter 2 (117 pages), and hypercubes and related networks for Chapter 3 (388 pages). Within each chapter, the material is organized according to the application domain, starting with the simple algorithms and advancing to the more complicated. Emphasis is placed on the paradigms and primitives for parallel algorithm design.
