Addison Wesley, ISBN: 0-201-64865-2, 2003.
Ananth Grama, Purdue University, W. Lafayette, IN 47906
(ayg@cs.purdue.edu)
Anshul Gupta, IBM T.J. Watson Research Center, Yorktown Heights, NY 10598
(anshul@watson.ibm.com)
George Karypis, University of Minnesota, Minneapolis, MN 55455
(karypis@cs.umn.edu)
Vipin Kumar, University of Minnesota, Minneapolis, MN 55455
(kumar@cs.umn.edu)
PART I: BASIC CONCEPTS
1. Introduction
(.pdf)
(.ppt)
2. Parallel Programming Platforms
(.pdf)
(.ppt)
3. Programming Shared Address Space Platforms
(.pdf)
(.ppt)
4. Programming Message Passing Platforms
(.pdf)
(.ppt)
PART II: PARALLEL ALGORITHMS: BASIC PRINCIPLES
5. Principles of Parallel Algorithm Design
(.pdf)
(.ppt)
6. Basic Communication Operations
(.pdf)
(.ppt)
7. Analytical Modeling of Parallel Programs
(.pdf)
(.ppt)
PART III: PARALLEL ALGORITHMS FOR KEY KERNELS
8. Dense Matrix Algorithms
(.pdf)
(.ppt)
9. Sorting
(.pdf)
(.ppt)
10. Graph Algorithms
(.pdf)
(.ppt)
11. Discrete Optimization Problems
(.pdf)
(.ppt)
12. Dynamic Programming
(.pdf)
(.ppt)