COMP 322: Fundamentals of Parallel Programming (Spring 2014)
...
- Deterministic Shared-Memory Parallelism: creation and coordination of parallelism (async, finish), abstract performance metrics (work, critical paths), Amdahl's Law, weak vs. strong scaling, data races and determinism, data race avoidance (immutability, futures, accumulators, dataflow), deadlock avoidance, abstract vs. real performance (granularity, scalability), collective & point-to-point synchronization (phasers, barriers), parallel algorithms, systolic arrays.
- Nondeterministic Shared-Memory Parallelism and Concurrency: critical sections, atomicity, isolation, high level data races, nondeterminism, linearizability, liveness/progress guarantees, actors, request-response parallelism, Java Concurrency, locks, condition variables, semaphores, memory consistency models.
- Distributed-Memory Parallelism and Locality: memory hierarchies, cache affinity, data movement, message-passing (MPI), communication overheads (bandwidth, latency), MapReduce, accelerators, GPGPUs, CUDA, OpenCL, energy efficiency, resilience.
Prerequisite
The prerequisite course requirements are COMP 182 and COMP 215. COMP 322 should be accessible to anyone familiar with the foundations of sequential algorithms and data structures, and with basic Java programming. COMP 221 is also recommended as a co-requisite.
...
There are no required textbooks for the class. Instead, lecture handouts are provided for each module as follows:
- Module 1 handout (Deterministic Shared-Memory Parallelism)
- Module 2 handout (Nondeterministic Shared-Memory Parallelism and Concurrency)
- Module 3 handout (Distributed-Memory Parallelism and Locality)
...
Past Offerings of COMP 322
Quiz Schedule
...
Lecture Schedule
Week | Day | Date (2013) | Topic | Reading | Slides | edX links | Code Examples | Homework Assigned | Homework Due |
|---|---|---|---|---|---|---|---|---|---|
1 | Mon | Jan 13 | Lecture 1: The What and Why of Parallel Programming | Module 1: Sections1.1, 1.2, 2.1, 2.2 |
|
|
| ||
| Wed | Jan 15 | Lecture 2: Async-Finish Parallel Programming, Data & Control Flow with Async Tasks, Computation Graphs | Module 1: Sections 1.3, 3.1, 3.2 |
|
| |||
| Fri | Jan 17 | Lecture 3: Computation Graphs (contd), Parallel Speedup, Strong Scaling, Abstract Performance Metrics | Module 1: Sections 3.1, 3.2, 3.3 | ArraySum1.hj | ||||
2 | Mon | Jan 20 | Lecture 4: Abstract Performance Metrics (contd), Parallel Efficiency, Amdahl's Law, Weak Scaling | Module 1: Sections 3.3, 3.4 | Search2.hj | ||||
| Wed | Jan 22 | Lecture 5: Data Races, Determinism, Memory Models | Module 1: Chapter 4 | |||||
| Fri | Jan 24 | Lecture 6: Data races (contd), Futures --- Tasks with Return Values | Module 1: Chapter 4, Section 5.1, 5.2 | |||||
3 | Mon | Jan 27 | No lecture, School Holiday (Martin Luther King, Jr. Day) | ||||||
| Wed | Jan 29 | No lecture, Reading Assignment on Futures: Chapter 5 of Module 1 handout | Module 1: Chapter 5 | HW1 (due by 5pm on Jan 23rd) | ||||
| Fri | Jan 31 | Lecture 7: Futures (contd), Parallel Design Patterns, Finish Accumulators | Module 1: Chapter 5, Chapter 6 | |||||
4 | Mon | Feb 03 | Lecture 8: Parallel N-Queens, Parallel Prefix Sum (Array Reductions with Associative Operators) | Module 1: Chapter 7 | |||||
| Wed | Feb 05 | Lecture 9: Abstract vs. Real Performance | Module 1: Chapter 9 | |||||
| Fri | Feb 07 | Lecture 10: Abstract vs. Real Performance (contd), seq clause | Module 1: Chapter 9 | |||||
5 | Mon | Feb 10 | Lecture 11: Forasync Loops, Forasync Chunking | Module 1: Sections 8.1, 9.4 | |||||
| Wed | Feb 12 | Lecture 12: Forall Loops, Barrier Synchronization | Module 1: Sections 10.1, 10.2, 10.4 | HW2 (due by 5pm on Feb 7th) | ||||
| Fri | Feb 14 | Lecture 13: Forall and Barriers, Dataflow Computing, Data-Driven Tasks | Module 1: Chapters 10, 11 | |||||
6 | Mon | Feb 17 | Lecture 14: Recap of HJ constructs, Point-to-point Synchronization, Pipeline Parallelism, Introduction to Phasers | Module 1: Sections 12.1, 12.2 | |||||
| Wed | Feb 19 | Lecture 15: Point-to-point Synchronization with Phasers | Module 1: Section 12.3 | |||||
| Fri | Feb 21 | Lecture 16: Phaser Accumulators, Bounded Phasers, Summary of Barriers and Phasers | Module 1: Chapter 12 | |||||
7 | Mon | Feb 24 | Lecture 17: Midterm Summary | ||||||
| Wed | Feb 26 | Lecture 18: Midterm Summary (contd), Take-home Exam 1 distributed | ||||||
| F | Feb 28 | No Lecture (Exam 1 due by 5pm today) | HW3 (due by 11:55pm on Feb 24th) | |||||
- | M-F | Feb 28- Mar 09 | Spring Break |
|
|
|
|
| |
8 | Mon | Mar 10 | Lecture 19: Critical sections, Isolated statement, Atomic variables | Module 2: Chapters 1, 2, 4, 6 |
| ||||
| Wed | Mar 12 | Lecture 20: Parallel Spanning Tree algorithm, Monitors, Java Concurrent Collections | Module 2: Chapters 3, 7 | HW4, hw_4.zip |
| |||
| Fri | Mar 14 | Lecture 21: Actors | Module 2: Chapter 8 |
| ||||
9 | Mon | Mar 17 | Lecture 22: Actors (contd), Linearizability of Concurrent Objects | Module 2: Chapters 8, 9 |
|
|
| ||
| Wed | Mar 19 | Lecture 23: Linearizability of Concurrent Objects (contd) | Module 2: Chapters 9, 10 |
|
| |||
| Fri | Mar 21 | Lecture 24: Safety and Liveness Properties, Intro to Java Threads | Module 2: Chapters 11, 12 |
|
|
| ||
10 | Mon | Mar 24 | Lecture 25: Java Threads (contd), Java synchronized statement | Module 2: Chapters 12, 13, 14 |
|
|
| ||
| Wed | Mar 26 | Lecture 26: Java synchronized statement (contd), advanced locking | Module 2: Chapter 14 |
| ||||
| Fri | Mar 28 | Lecture 27: Speculative parallelization of isolated blocks (Guest lecture by Prof. Swarat Chaudhuri) |
|
| HW4 (due by 11:55pm on March 22nd) | |||
11 | Mon | Mar 31 | Lecture 28: Java Executors and Synchronizers |
|
|
| |||
| Wed | Apr 02 | Lecture 29: Dining Philosophers Problem |
|
|
| |||
- | Fri | Apr 04 | Midterm Recess | ||||||
12 | Mon | Apr 07 | Lecture 30: Task Affinity with Places | HW5, hw_5.zip |
| ||||
| Wed | Apr 09 | Lecture 31: More on Actors: Places, Dining Philosophers (Guest lecture by Shams Imam) |
|
| ||||
| Fri | Apr 11 | Lecture 32: Message Passing Interface (MPI) |
|
|
| |||
13 | Mon | Apr 14 | Lecture 33: Message Passing Interface (MPI, contd) |
| |||||
| Wed | Apr 16 | Lecture 34: Message Passing Interface (MPI, contd) |
|
|
| |||
| Fri | Apr 18 | Lecture 35: Cloud Computing, Map Reduce |
|
| HW5 (due by 11:55pm on Sunday, April 14th) | |||
14 | Mon | Apr 21 | Lecture 36: Partitioned Global Address Space (PGAS) languages (Guest lecture by Prof. John Mellor-Crummey) |
| |||||
| Wed | Apr 23 | Lecture 37: Comparison of Parallel Programming Models |
|
|
| |||
| Fri | Apr 25 | Lecture 38: Course Review, Take-home Exam 2 distributed | HW6 (due by 11:55pm on April 19th, penalty-free extension till April 26th) | |||||
- | Fri | May 02 | No lectures this week — Exam 2 due by 4pm today |
|
|
|
|
|
...