...
| Day | Date (2012) | Topic | Slides | Audio (Panopto) | Code Examples | Homework Assigned | Homework Due |
|---|---|---|---|---|---|---|---|---|
1 | MonWed | Jan 9Sep 05 | Lecture 1: The What and Why of Parallel Programming |
|
| |||
2 | WedMon | Jan 11Sep 10 | Lecture 2: Async-Finish Parallel Programming and Computation Graphs |
|
| |||
3 | FriWed | Jan 13Sep 12 | Lecture 3: Computation Graphs, Abstract Performance Metrics, Array Reductions | HW1 | ||||
- | MonJan | 16Sep 17 | School Holiday |
|
|
|
|
|
4 | WedJan | 18Sep 19 | Lecture 4: Parallel Speedup, Efficiency, Amdahl's Law |
|
|
| ||
5 | FriMon | Jan 20Sep 24 | Lecture 5: Data & Control Flow with Async Tasks, Data Races | (See Lab 3) |
|
| ||
6 | MonWed | Jan 23Sep 26 | Lecture 6: Memory Models, Atomic Variables | (See Lab 3) |
|
| ||
7 | WedMon | Jan 25Oct 01 | Lecture 7: Memory Models (contd), Futures --- Tasks with Return Values |
|
| |||
8 | FriWed | Jan 27Oct 03 | Lecture 8: Futures (contd), Dataflow Programming, Data-Driven Tasks |
|
| |||
9 | MonJan | 30Oct 08 | Lecture 9: Abstract vs. Real Performance, seq clause, forasync loops |
| HW2 | |||
10 | WedFeb | 01Oct 10 | Lecture 10: Forasync Chunking, Parallel Prefix Sum algorithm |
|
|
| ||
11 | FriMon | Feb 03Oct 15 | Lecture 11: Parallel Prefix Sum (contd), Parallel Quicksort |
| HW3 (HJ Programming Assignment), SeqScoring.hj, X.txt, Y.txt, BigSeq.zip |
| ||
12 | MonWed | Feb 06Oct 17 | Lecture 12: Finish Accumulators, Forall Loops and Barrier Synchronization |
|
|
| ||
13 | WedMon | Feb 08Oct 22 | Lecture 13: Forall Loops and Barrier Synchronization (contd) |
|
|
| ||
14 | FriWed | Feb 10Oct 24 | Lecture 14: Point-to-point Synchronization and Phasers |
|
|
| ||
15 | MonFeb | 13Oct 29 | Lecture 15: Phaser Accumulators, Bounded Phasers |
|
|
| ||
16 | WedFeb | 15Oct 31 | Lecture 16: Summary of Barriers and Phasers |
|
|
| ||
17 | FriMon | Feb 17Nov 05 | Lecture 17: Task Affinity with Places |
|
|
| ||
18 | MonWed | Feb 20Nov 07 | Lecture 18: Task Affinity with Places (contd) |
|
|
| ||
19 | WedMon | Feb 22Nov 12 | Lecture 19: Midterm Summary |
|
|
|
| |
- | F | Feb 24 | No Lecture (Take-home Exam 1 due by 4pm today) |
|
|
|
| HW3 |
- | M-F | Feb 27 - Mar 02 | Spring Break |
|
|
|
|
|
20 | MonWed | Mar 05Nov 14 | Lecture 20: Critical sections and the Isolated statement |
|
|
| ||
21 | WedMon | Mar 07Nov 19 | Lecture 21: Isolated statement (contd), Monitors, Actors |
|
| |||
22 | FriWed | Mar 09Nov 21 | Lecture 22: Actors (contd) |
|
| |||
23 | Mon | Mar 12 | Lecture 23: Linearizability of Concurrent Objects |
|
|
| ||
24 | Wed | Mar 14 | Lecture 24: Linearizability of Concurrent Objects (contd) |
|
|
| ||
25 | Fri | Mar 16 | Lecture 25: Safety and Liveness Properties |
|
|
| ||
26 | Mon | Mar 19 | Lecture 26: Parallel Programming Patterns |
|
|
| ||
27 | Wed | Mar 21 | Lecture 27: Introduction to Java Threads |
| HW4 | |||
- | Fri | Mar 23 | Midterm Recess |
|
|
|
|
|
28 | Mon | Mar 26 | Lecture 28: Bitonic Sort (guest lecture by Prof. John Mellor-Crummey) |
|
|
|
| |
29 | Wed | Mar 28 | Lecture 29: Java Threads (contd), Java synchronized statement |
|
|
| ||
30 | Fri | Mar 30 | Lecture 30: Java synchronized statement (contd), advanced locking |
|
|
| ||
31 | Mon | Apr 02 | Lecture 31: Java Executors and Synchronizers |
|
|
| ||
32 | Wed | Apr 04 | Lecture 32: Volatile Variables and Java Memory Model |
|
|
| ||
33 | Fri | Apr 06 | Lecture 33: Message Passing Interface (MPI) |
|
| HW5 | ||
34 | Mon | Apr 09 | Lecture 34: Message Passing Interface (MPI, contd) |
|
| |||
35 | Wed | Apr 11 | Lecture 35: Cloud Computing, Map Reduce |
|
|
| ||
36 | Fri | Apr 13 | Lecture 36: Map Reduce (contd) |
|
|
| ||
37 | Mon | Apr 16 | Lecture 37: Speculative parallelization of isolated blocks (Guest lecture by Prof. Swarat Chaudhuri) |
|
|
|
| |
38 | Wed | Apr 18 | Lecture 38: Comparison of Parallel Programming Models |
|
|
| ||
39 | Fri | Apr 20 | Lecture 39: Course Review |
| Exam 2 (Take-home) | HW6 | ||
- | Fri | Apr 27 | Exam 2 due |
|
|
|
| Exam 2 |
...