JáJá J. An Introduction to Parallel Algorithms

Addison-Wesley, 1992. — 579 p.This book is an introduction to the design and analysis of parallel algorithms. There is sufficient material for a one-semester course at the senior or first-year graduate level, and for a follow-up graduate-level course covering more advanced material. Our principal model for algorithmic design is the shared-memory model; however, all of our algorithms are described at a high level similar to that provided by a data-parallel programming environment. It is assumed that the reader has some understanding of elementary discrete mathematics, basic data structures, and algorithms, at the level covered in typical undergraduate curricula in computer science and computer engineering.Basic Techniques
Lists and Trees
Searching, Merging, and Sorting
Graphs
Planar Geometry
Strings
Arithmetic Computations
Randomized Algorithms
Limitations of PRAMs