...
| Day | Date (2011) | Topic | Handouts | Slides | Homework Assigned | Homework Due | |
|---|---|---|---|---|---|---|---|---|
1 | Mon | Jan 10 | Lecture 1: The What and Why of Parallel Programming |
| ||||
2 | Wed | Jan 12 | Lecture 2: Task Creation & Termination using Async & Finish |
|
| |||
3 | Fri | Jan 14 | Lecture 3: Computation Graphs, Abstract Performance Metrics | lec3-handout | HW1 | |||
- | Mon | Jan 17 | School Holiday |
|
|
|
| |
4 | Wed | Jan 19 | Lecture 4: Futures --- Tasks with Return Values |
|
| |||
5 | Fri | Jan 21 | Lecture 5: Parallel Array Sum and Array Reductions |
| HW2 | |||
6 | Mon | Jan 24 | Lecture 6: Data Races and How to Avoid Them |
| ||||
7 | Wed | Jan 26 | Lecture 7: Parallel Prefix Sum, Forall parallel loops |
|
| |||
8 | Fri | Jan 28 | Lecture 8: Parallel Quicksort | lec8-handout |
|
| ||
9 | Mon | Jan 31 | Lecture 9: PRAM model, Amdahl's Law |
|
| |||
10 | Wed | Feb 02 | Lecture 10: Critical sections and the Isolated statement | lec10-handout |
|
| ||
- | Fri | Feb 04 | No Lecture, School closed due to inclement weather |
|
|
|
| |
11 | Mon | Feb 07 | Lecture 11: Abstract vs Real Performance, Work-sharing & Work-stealing schedulers |
| HW3 | |||
12 | Wed | Feb 09 | Lecture 12: Barrier Synchronization in Forall Loops |
| ||||
13 | Fri | Feb 11 | Lecture 13: Barrier Synchronization in Forall Loops (contd) |
|
| |||
14 | Mon | Feb 14 | Lecture 14: Point-to-point Synchronization and Phasers |
|
| |||
15 | Wed | Feb 16 | Lecture 15: Point-to-point Synchronization and Phasers (contd) |
| HW4 | |||
16 | Fri | Feb 18 | Lecture 16: Guest Lecture on Bitonic Sort (John Mellor-Crummey) |
|
|
| ||
17 | Mon | Feb 21 | Lecture 17: Advanced Phaser topics |
|
| |||
18 | Wed | Feb 23 | Lecture 18: Midterm Summary |
| Midterm Exam (Take-home) |
| ||
- | Fri | Feb 25 | No lecture, Midterm Exam due today |
|
|
| Midterm Exam (Take-home) | |
- | M-F | Feb 28 - Mar 04 | Spring Break |
| HW5 (Written Assignment) |
| ||
19 | Mon | Mar 07 | Lecture 19: Java Atomic Variables |
|
|
|
| |
20 | Wed | Mar 09 | [lec19-handout | https://svn.rice.edu/r/comp322/course/comp322-s11-lec19.pdf] | | | || |
|
|
|
|
21 | Fri | Mar 11 | Lecture 21: Task Affinity with Places |
|
|
|
| |
22 | Mon | Mar 14 | | | | | || |
|
| | | | HW6 (Programming Assignment) | HW5 | |
23 | Wed | || | Lecture 23: Bounded Buffers |
|
|
|
| |
24 | Fri | Mar 18 | | | | | || |
|
|
|
| |
25 | Mon | Mar 21 | | | || |
|
|
|
| |
26 | Wed | Mar 23 |
|
|
|
|
| |
- | Fri | Mar 25 | Midterm Recess |
|
|
|
| |
27 | Mon | Mar 28 | Midterm Recess | | | | || |
|
|
|
| |
28 | Wed | Mar 30 | | | | | || |
|
|
|
| |
29 | Fri | Apr 01 | | |
|
| HW7 (Programming Assignment) | | HW6 || || | |
30 | | Mon | | Apr 04 | | Lecture 30: Java Locks & Conditions | | | | || |
|
|
|
| |
31 | Wed | Apr 06 | Lecture 31: Java Synchronizers |
|
|
|
| |
32 | Fri | Apr 08 | | | | | || |
|
|
|
| |
33 | Mon | Apr 11 | | | || |
|
|
|
| |
34 | Wed | Apr 13 | | || |
|
|
|
| |
35 | Fri | Apr 15 |
|
|
|
|
| |
36 | Mon | Apr 18 | | Mon | Apr 18 | Lecture 36: Distributed-memory programming with MPI | | | | || |
|
|
|
| |
37 | Wed | Apr 20 | Wed | Apr 20 | Lecture 37: MPI contd. | | | | || |
|
|
|
| |
38 | Fri | Apr 22 | | Lecture 38: Course Summary |
|
| | | | Final Exam (Take-home) | | HW7 || || | |
- | | Fri | | Apr 29 |
|
|
|
| | | | | | Final Exam (Take-home) || h2. |
Lab Schedule ||
Lab # | || Date (2011) | || Topic | || Handouts | |||| | |||
|---|---|---|---|---|---|---|---|
1 | | Jan 11, 12 | | Infrastructure setup | | lab1-handout || || | ||||
2 | | Jan 18, 19 | | Abstract performance metrics with async & finish | | lab2-handout || || | ||||
3 | | Jan 25, 26 | | Data race detection | | lab3-handout || || | ||||
4 | | Feb 01, 02 | | Points, regions, forall loops | | lab4-handout || || | ||||
5 | | Feb 08, 09 | | Abstract vs Real Performance, Work-sharing & Work-stealing schedulers | lab5-handout || || | ||||
6 | | Feb 15, 16 | | Barriers and Phasers | | lab6-handout || || | ||||
- | | Feb 22, 23 | | No lab (midterm week) | || |
| ||||
7 | Mar 08, 09 | | Map Reduce & Generalized Scan | || |
| ||||
8 | Mar 15, 16 | Places |
| ||||
9 | | Places | || | Data Flow Programming with CnC-HJ | || |
| ||||
10 | Apr 05, 06 | | Java Concurrency |
| ||||
11 | | || | CUDA |
| ||||
12 | Apr 19, 20 | MPI | || | MPI |
|
Grading, Honor Code Policy, Processes and Procedures
Grading will be based on your performance on homeworks (worth 50%) and exams (20% for first exam, and 30% for the second exam).
The purpose of the homeworks is to train you to solve problems and to help deepen your understanding of concepts introduced in class. Homeworks and programming assignments are due on the dates and times specified in the course schedule. Please turn in all your homeworks using the CLEAR turn-in system. Homework is worth full credit when turned in on time. A 10% penalty per day will be levied on late homeworks, up to a maximum of 6 days. No submissions will be accepted more than 6 days after the due date.
...