Table of contents :
pt. 1. Basic techniques. Parallel computers --
Message-passing computing --
Embarrassingly parallel computations --
Partitioning and divide-and-conquer strategies --
Pipelined computations --
Synchronous computations --
Load balancing and termination detection --
Programming with shared memory --
pt. 2. Algorithms and applications. Sorting algorithms --
Numerical algorithms --
Image processing --
Searching and optimization --
Appendix A: Basic PVM routines --
Appendix B: Basic MPI routines --
Appendix C: Basic Pthread routines --
Appendix D: Parallel computation models.

Summary :
Designed for an undergraduate computer science student or professional, this text covers the techniques of parallel programming in a practical manner that enables students to write and evaluate their parallel programs. Supported by the National Science Foundation and exhaustively class-tested, it is the first text of its kind that does not require access to a special multiprocessor system, concentrating instead on parallel programs that can be executed on networked workstations using freely available parallel software tools.