| Lecture | Date | Notes |
| 1 | 4/1 | Introduction |
| 2 | 4/3 | Theoretical basis, performance, and an introduction to message passing |
| 3 | 4/8 | Sorting; Introduction to message passing with MPI |
| 4 | 4/10 |
Applications of MPI,
Collective communication,
Interconnection networks, Communication performance |
| 5 | 4/15 |
Local communication in higher dimensions; Performance modeling and scalability. (With fixes to notes) A1 due, A2 assigned |
| 6 | 4/17 | Scalability and performance metrics, communicators, matrix multiplication |
| 7 | 4/22 | Advanced sorting, more collective communication |
| 8 | 4/24 |
Bitonic sort; word problems A2 due, A3 assigned (problem set) |
| 9 | 4/29 | Partitioning and client/server |
| 10 | 5/1 |
Midterm review A3 due, A4 assigned |
| 11 | 5/6 | MIDTERM |
| 12 | 5/8 | Shared memory architecture |
| 13 | 5/13 | Shared memory programming |
| 14 | 5/15 | Data parallel programming. A4 due, A5 assigned |
| 15 | 5/20 | Solving systems of linear equations |
| 16 | 5/22 | Dealing with I/O |
| 17 | 5/27 | MPI Datatypes; more I/O. A5 Due, A6 assigned |
| 18 | 5/29 |
Image processing Fast Fourier Transform (FFT) |
| 19 | 6/5 | Large scale computing |
| 20 | 6/7 |
Final exam review A6 Due |
| - | 6/12 | Final exam: 3pm to 6pm |
Maintained by Scott Baden. Last modified: Wednesday, April 02, 2003 02:52 PM