Introduction to Parallel Computing.

Intro to Parallel

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)

Follow this link for a recent review of the book published at IEEE Distributed Systems Online.



Solutions to Selected Problems

The solutions are password protected and are only available to lecturers at academic institutions.

Click here to apply for a password.

Click here to download the solutions (PDF File).


Table of Contents (PDF file)

PART I: BASIC CONCEPTS

1. Introduction (figures: [PDF] [PS])

2. Parallel Programming Platforms (figures: [PPT] [PDF] [PS])
    (GK lecture slides [PDF]) (AG lecture slides [PPT][PDF][PS])

3. Principles of Parallel Algorithm Design (figures: [PPT] [PDF] [PS], algorithms: [PDF] [PS])
    (GK lecture slides [PDF]) (AG lecture slides [PPT][PDF][PS])

4. Basic Communication Operations (figures: [PPT] [PDF] [PS], algorithms: [PDF] [PS])
    (GK lecture slides [PDF]) (AG lecture slides [PPT][PDF][PS])

5. Analytical Modeling of Parallel Programs (figures: [PPT] [PDF] [PS])
    (GK lecture slides [PDF]) (AG lecture slides [PPT][PDF][PS])

PART II: PARALLEL PROGRAMMING

6. Programming Using the Message Passing Paradigm (figures: [PPT] [PDF] [PS])
    (GK lecture slides [PDF]) (AG lecture slides [PPT][PDF][PS])

7. Programming Shared Address Space Platforms (figures: [PPT] [PDF] [PS])
    (GK lecture slides [PDF]) (AG lecture slides [PPT][PDF][PS])
    (A complete set of Pthread programs)

PART III: PARALLEL ALGORITHMS AND APPLICATIONS

8. Dense Matrix Algorithms (figures: [PPT] [PDF] [PS], algorithms: [PDF] [PS])
    (GK lecture slides [PDF]) (AG lecture slides [PPT][PDF][PS])

9. Sorting (figures: [PPT] [PDF] [PS], algorithms: [PDF] [PS])
    (GK lecture slides [PDF]) (AG lecture slides [PPT][PDF][PS])

10. Graph Algorithms (figures: [PPT] [PDF] [PS], algorithms: [PDF] [PS])
    (GK lecture slides [PDF]) (AG lecture slides [PPT][PDF][PS])

11. Search Algorithms for Discrete Optimization Problems (figures: [PPT] [PDF] [PS])
    (GK lecture slides [PDF]) (AG lecture slides [PPT][PDF][PS])

12. Dynamic Programming (figures: [PPT] [PDF] [PS])
    (AG lecture slides [PPT][PDF][PS])

13. Fast Fourier Transform  (figures: [PDF] [PS], algorithms: [PDF] [PS])
   

 

The views and opinions expressed in this page are strictly those of the page author.
The contents of this page have not been reviewed or approved by the University of Minnesota.