Barry Wilkinson, the Univ. North Carolina, Charlotte
Michael Allen, the Univ. North Carolina, Charlotte

Published August, 1998 by Prentice Hall Engineering/Science/Mathematics

Copyright 1999, 431 pp.
Paper
ISBN 0-13-671710-1
$52.00

Sign up for future
mailings on this subject.

See other books about:
    Parallel/Concurrent Programming

Designed for an undergraduate computer science student or professional, this accessible 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. Key Features:

• Introduces parallel programming techniques as a natural extension to sequential programming, developing the basic techniques of message-passing parallel programming, and then studying problem-specific algorithms in both non-numeric and numeric domains.
• Requires no prerequisite in parallel programming; assumes only C programming

knowledge.

• Uses MPI and PVM pseudocodes to describe algorithms and allows different

programming tools to be implemented.

• Provides students with thorough coverage of shared memory programming and

Pthreads to assist them in shared memory programming assignments.

• Explores such applications as numerical algorithms, image processing,

searching, and optimization.





BARRY WILKINSON and MICHAEL ALLEN have created a comprehensive instructor's support website, including examples, assignments, and instructional materials for using the MPI and PVM software. The materials include extensive web pages to help students learn how to compile and run parallel programs as well as sample programs.



I. BASIC TECHNIQUES.

1. Parallel Computers.
2. Message-Passing Computing.
3. Embarrassingly Parallel Computations.
4. Partitioning and Divide-and-Conquer Strategies.
5. Pipelined Computations.
6. Synchronous Computations.
7. Load Balancing and Termination Detection.
8. Programming with Shared Memory.

II. ALGORITHMS AND APPLICATIONS.

9. Sorting Algorithms.
10. Numerical Algorithms.
11. Image Processing.
12. Searching and Optimization.
Appendix A: Basic PVM Routines.
Appendix B: Basic MPI Routines.
Appendix C: Basic Pthread Routines.
Appendix D: Parallel Computation Models.
Index.