Parallel Computing Using the Prefix Problem [Hardcover]

The prefix operation on a set of data is one of the simplest and most useful building blocks in parallel algorithms. This introduction to those aspects of parallel programming and parallel algorithms that relate to the prefix problem emphasizes its use in a broad range of familiar and important problems. The book illustrates how the prefix operation approach to parallel computing leads to fast and efficient solutions to many different kinds of problems. Students, teachers, programmers, and computer scientists will want to read this clear exposition of an important approach.

1. The Prefix Problem and Its Applications
2. Parallel Machines and Models--An Overview
3. Parallel Prefix Algorithms on Arrays
4. Parallel Prefix Algorithms on Linked Lists
5. Parallel Prefix Circuits
6. Size Vs. Depth Trade-Off in Parallel Prefix Circuits
7. Methods for Bounding Fan-out
8. Constant Depth Prefix Circuits with Unbounded Fan-in
Appendices

The book is well organized and the exposition is self-contained. Furthermore, there are many interesting exercises at the end of each chapter. The reviewer recommends this book for use in a graduate class on parallel algorithm design and for researchers in parallel algorithm design. --MathematicalReviews