...
Instructor: | Prof. Vivek Sarkar, DH 3131 | Graduate TA: | |
|---|---|---|---|
| Please send all emails to comp322-staff at rice dot edu | Graduate TA: | |
|
| Undergrad TA: | Christopher Nunu |
Assistant: | Amanda Nokleby, akn3@rice.edu, DH 3122 3137 | Undergrad TA: | Max Grossman |
|
| Research Programmer: | Vincent Cave |
Lectures: | Duncan Hall (DH) 1042 | Time: | MWF 1:00-01:50pm |
Labs: | Ryon 102 | Times: | Tuesday 2:30-3:50pm (Sec 1), Wednesday 3:30-4:50pm (Sec 2) |
...
| 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 | Lecture 20: Java Concurrent Collections |
|
| ||||
21 | Fri | Mar 11 | Lecture 21: Task Affinity with Places |
|
| HW5 (Written Assignment) |
| ||
22 | Mon | Mar 14 | Lecture 22: Task Affinity with Places, contd. |
|
| HW6 (Programming Assignment) | HW5 | ||
23 | Wed | Mar 16 | Lecture 23: Bounded Buffers |
|
|
|
| ||
24 | Fri | Mar 18 | Lecture 24: Map Reduce, Phaser Accumulators |
|
|
| HW6 (Programming Assignment) | HW5 | |
25 | Mon | Mar 21 | Lecture 25: Data Flow Programming |
|
|
|
| ||
26 | Wed | Mar 23 | Lecture 26: Data Flow Programming, contd |
|
|
|
| ||
- | Fri | Mar 25 | Midterm Recess |
|
|
|
| ||
27 | Mon | Mar 28 | Lecture 27: Java Threads and synchronized statement |
|
|
|
| ||
28 | Wed | Mar 30 | Lecture 28: GUI Applications |
|
|
|
| ||
29 | Fri | Apr 01 | Lecture 29: Java Executors |
|
| 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 | Lecture 32: Deadlock, Livelock, Liveness |
|
|
|
| ||
33 | Mon | Apr 11 | Lecture 33: Java Memory Model and Volatile Variables |
|
|
|
| ||
34 | Wed | Apr 13 | Lecture 34: GPGPU programming with CUDA |
|
|
|
| ||
35 | Fri | Apr 15 | Lecture 35: CUDA contd. |
|
|
|
| ||
36 | Mon | Apr 18 | Lecture 36: Distributed-memory programming with MPI |
|
|
|
| ||
37 | 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) |
...
The work you submit for this class is expected to be the result of your own work and that of your homework partner. You are free to discuss course material and approaches to problems with your other classmates, the teaching assistants and the professor, but you should never misrepresent someone else’s work as your own. If you use any material from online sources, you must provide proper attribution (as shown here) in your homework/programming assignment turnins. A tutorial on how and when to cite sources is here. You should explain what value you have added to work taken from online sources. Finally, it is also your responsibility to protect your work from unauthorized access. I will expect you to follow the Honor Code in this course.
Graded homeworks will be returned to you via email, and exams as marked-up hardcopies. If you believe we have made an error in grading your homework or exam, please bring the matter to our attention within one week.
...