Alan Kaminsky Department of Computer Science Rochester Institute of Technology 4486 + 2220 = 6706
Home Page
Parallel Computing II 4005-736-70 Spring Quarter 2012
Course Page

4005-736-70 Parallel Computing II
Building Parallel Programs Source Code

Prof. Alan Kaminsky -- Spring Quarter 2012
Rochester Institute of Technology -- Department of Computer Science


Part I. Preliminaries
4. A First Parallel Program
 
Part II. SMPs
5. Massively Parallel Problems
6. SMP Parallel Programming
7. Massively Parallel Problems, Part 2
8. Measuring Speedup
9. Cache Interference
10. Measuring Sizeup
11. Parallel Image Generation
12. Load Balancing
13. Reduction
14. Parallel Random Number Generation
15. Reduction, Part 2
16. Sequential Dependencies
17. Barrier Actions
18. Overlapping
Part III. Clusters
19. A First Cluster Parallel Program
21. Massively Parallel Problems, Part 3
23. Load Balancing, Part 2
24. Measuring Communication Overhead
25. Broadcast
26. Reduction, Part 3
27. All-Gather
28. Scalability and Pipelining
29. Overlapping, Part 2
30. All-Reduce
31. All-to-All and Scan
 
Part IV. Hybrid SMP Clusters
32. Massively Parallel Problems, Part 4
33. Load Balancing, Part 3
34. Partitioning and Broadcast, Part 2
35. Parallel Data-Set Querying
Part V. Applications
36. MRI Spin Relaxometry
37. Protein Sequence Querying
38. Phylogenetic Tree Construction


Chapter 4. A First Parallel Program


Chapter 5. Massively Parallel Problems
Chapter 6. SMP Parallel Programming
Chapter 7. Massively Parallel Problems, Part 2
Chapter 8. Measuring Speedup
Chapter 9. Cache Interference
Chapter 10. Measuring Sizeup


Chapter 11. Parallel Image Generation
Chapter 12. Load Balancing


Chapter 13. Reduction
Chapter 14. Parallel Random Number Generation


Chapter 15. Reduction, Part 2


Chapter 16. Sequential Dependencies


Chapter 17. Barrier Actions
Chapter 18. Overlapping


Chapter 19. A First Cluster Parallel Program


Chapter 21. Massively Parallel Problems, Part 3


Chapter 23. Load Balancing, Part 2
Chapter 24. Measuring Communication Overhead


Chapter 25. Broadcast


Chapter 26. Reduction, Part 3


Chapter 27. All-Gather
Chapter 28. Scalability and Pipelining
Chapter 29. Overlapping, Part 2


Chapter 30. All-Reduce


Chapter 31. All-to-All and Scan


Chapter 32. Massively Parallel Problems, Part 4


Chapter 33. Load Balancing, Part 3


Chapter 34. Partitioning and Broadcast, Part 2


Chapter 35. Parallel Data-Set Querying
  101   103       107   109
      113            
              127    
  131           137   139
                  149


Chapter 36. MRI Spin Relaxometry
 


Chapter 37. Protein Sequence Querying
 


Chapter 38. Phylogenetic Tree Construction
 
 

Parallel Computing II 4005-736-70 Spring Quarter 2012
Course Page
Alan Kaminsky Department of Computer Science Rochester Institute of Technology 4486 + 2220 = 6706
Home Page
Copyright © 2012 Alan Kaminsky. All rights reserved. Last updated 06-Mar-2012. Please send comments to ark­@­cs.rit.edu.