COMP 322: Fundamentals of Parallel Programming (Spring
...
2022)
InstructorInstructors: | Mackale Joyner, DH 2063 Zoran Budimlić, DH 3003 | TAs: | Elian Ahmar, Timothy Goh, Kelly Park, Tucker ReinhardtAdrienne Li, Austin Hushower, Claire Xu, Diep Hoang, Hunena Badat, Maki Yu, Mantej Singh, Minh Vu, Thanh Vu, Robert Walsh, Frederick Wang, Xincheng Wang, Rose Zhang, Victor Song, Yidi Wang |
|---|---|---|---|
| Admin Assistant: | Annepha Hurlock, annepha@rice.edu , DH 3122, 713-348-5186 |
| |
Piazza site: | https://piazza.com/rice/spring2021spring2022/comp322 (Piazza is the preferred medium for all course communications) | Cross-listing: | ELEC 323 |
Lecture location: | Fully OnlineHerzstein Amphitheater (online 1st 2 weeks) | Lecture times: | MWF 1:30pm 00pm - 21:25pm50pm |
Lab locations: | Fully OnlineKeck 100 (online 1st 2 weeks) | Lab times: | Tu 1Mon 3:30pm 00pm - 23:25pm 50pm (TV, MS, TG, RWAustin, Claire) Th Wed 4:50pm 30pm - 5:45pm (XW, TR, KP, YW, FW, EA20pm (Hunena, Mantej, Yidi, Victor, Rose, Adrienne, Diep, Maki) |
Course Syllabus
A summary PDF file containing the course syllabus for the course can be found here. Much of the syllabus information is also included below in this course web site, along with some additional details that are not included in the syllabus.
...
The desired learning outcomes fall into three major areas (course modules):
1) Parallelism: functional programming, Java streams, 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 algorithms.
...
3) Locality & Distribution: memory hierarchies, locality, cache affinity, data movement, message-passing (MPI), communication overheads (bandwidth, latency), MapReduce, accelerators, GPGPUs, CUDA, OpenCL., MapReduce
To achieve these learning outcomes, each class period will include time for both instructor lectures and in-class exercises based on assigned reading and videos. The lab exercises will be used to help students gain hands-on programming experience with the concepts introduced in the lectures.
To ensure that students gain a strong knowledge of parallel programming foundations, the classes and homeworks homework will place equal emphasis on both theory and practice. The programming component of the course will mostly use the Habanero-Java Library (HJ-lib) pedagogic extension to the Java language developed in the Habanero Extreme Scale Software Research project at Rice University. The course will also introduce you to real-world parallel programming models including Java Concurrency, MapReduce, MPI, OpenCL and CUDA. An important goal is that, at the end of COMP 322, you should feel comfortable programming in any parallel language for which you are familiar with the underlying sequential language (Java or C). Any parallel programming primitives that you encounter in the future should be easily recognizable based on the fundamentals studied in COMP 322.
...
There
...
There are also a few optional textbooks that we will draw from during the course. You are encouraged to get copies of any or all of these books. They will serve as useful references both during and after this course:
- Fork-Join Parallelism with a Data-Structures Focus (FJP) by Dan Grossman (Chapter 7 in Topics in Parallel and Distributed Computing)
- Java Concurrency in Practice by Brian Goetz with Tim Peierls, Joshua Bloch, Joseph Bowbeer, David Holmes and Doug Lea
- Principles of Parallel Programming by Calvin Lin and Lawrence Snyder
- The Art of Multiprocessor Programming by Maurice Herlihy and Nir Shavit
Finally, here are some additional resources that may be helpful for you:
- Slides titled "MPI-based Approaches for Java" by Bryan Carpenter
...
Lecture Schedule
Week | Day | Date (20212022) | Lecture | Assigned Reading | Assigned Videos (see Canvas site for video links) | In-class Worksheets | Slides | Work Assigned | Work Due | Worksheet Solutions | ||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1 | Mon | Jan 2510 | Lecture 1: Task Creation and Termination (Async, Finish) | Module 1: Section 1.1 | Topic 1.1 Lecture, Topic 1.1 DemonstrationIntroduction |
| worksheet1 | lec1-slides | worksheet1 | lec1-slides |
|
| WS1-solution | |||||||||||
| Wed | Jan 2712 | Lecture 2: Computation Graphs, Ideal Parallelism | Module 1: Sections 1.2, 1.3 | Topic 1.2 Lecture, Topic 1.2 Demonstration, Topic 1.3 Lecture, Topic 1.3 Demonstration | worksheet2 | lec2-slides | Homework 1Functional Programming | GList.java | worksheet2 | lec02-slides |
|
| WS2-solution | ||||||||||
| Fri | Jan 2914 | Lecture 3: Abstract Performance Metrics, Multiprocessor Scheduling | Module 1: Section 1.4 | Topic 1.4 Lecture, Topic 1.4 Demonstration | worksheet3 | Higher order functions | worksheet3 | lec3-slides lec3-slides |
| WS3-solution | ||||||||||||||
2 | Mon | Jan 17 | No class: MLK | |||||||||||||||||||||
| Wed | Jan 19 | Lecture 4: Lazy Computation | LazyList.java Lazy.java | Feb 01 | Lecture 4: Parallel Speedup and Amdahl's Law | Module 1: Section 1.5 | Topic 1.5 Lecture, Topic 1.5 Demonstration | worksheet4 | lec4-slides | Quiz for Unit 1 | WS4-solution | ||||||||||||
| WedFri | Feb 03Jan 21 | Lecture 5: | Future Tasks, Functional Parallelism ("Back to the Future")Java Streams | Module 1: Section 2.1 | Topic 2.1 Lecture, Topic 2.1 Demonstrationworksheet5 | lec5-slides | Homework 1 | WS5-solution | |||||||||||||||
| 3 | FriMon | Feb 05Jan 24 | Lecture 6: Finish Accumulators Map Reduce with Java Streams | Module 1: Section 2.34 | Topic 2.3 4 Lecture, Topic 2.3 4 Demonstration | worksheet6 | lec6-slides |
| Quiz for Unit 1 | WS6-solution | ||||||||||||||
| 3 | Mon | Feb 08Wed | Jan 26 | Lecture 7: | Map ReduceFutures | Module 1: Section 2.41 | Topic 2. | 41 Lecture , Topic 2. | 41 Demonstration | worksheet7 | lec7-slides |
| WS7-solution | ||||||||||
| WedFri | Feb 10Jan 28 | Lecture 8: Data Races, Functional & Structural Determinism Computation Graphs, Ideal Parallelism | Module 1: Section Sections 1.2.5, 21.63 | Topic 1.2 .5 Lecture, Topic 1.2 .5 Demonstration, Topic 21.6 3 Lecture, Topic 21.6 3 Demonstration | worksheet8 | lec8-slides | WS8-solutionHomework 1 | ||||||||||||||||
4 | Mon
| Fri | Feb 12 | Lecture 9: Java’s Fork/Join LibraryJan 31 | Lecture 9: Async, Finish, Data-Driven Tasks | Module 1: Section 1.1, 4.5
| Topic 21. 71 Lecture, Topic 21. 71 Demonstration, Topic 24. 85 Lecture, Topic 24. 85 Demonstration | worksheet9 | lec9-slidesslides | Quiz for Unit 2 | WS9-solution | |||||||||||||
| 4 | Wed | Mon
| Feb | 15No class (weather)02 | Lecture 10: Event-based programming model
| worksheet10 | lec10-slides | WS10-solution | ||||||||||||||||
| WedFri | Feb 17 | Spring "Sprinkle" Day (no class) | 04 | Lecture 11: GUI programming as an example of event-based, futures/callbacks in GUI programming | worksheet11 | |||||||||||||||||||
| Fri | Feb 19 | No class (weather) | ||||||||||||||||||||||
| lec11-slides | Homework 2 | Homework 1 | WS11-solution | |||||||||||||||||||||
| 5 | Mon | Feb 2207 | Lecture 10: Loop-Level Parallelism, Parallel Matrix Multiplication12: Scheduling/executing computation graphs Abstract performance metrics | Module 1: Sections 3.Section 1, 3.24 | Topic 31.1 4 Lecture , Topic 3. 1 Demonstration , Topic 3.2 Lecture, Topic 3.2 .4 Demonstration | worksheet10worksheet12 | lec10lec12-slides | WS12-solution | ||||||||||||||||
| Wed | Feb 2409 | Lecture 11: Iteration Grouping (Chunking), Barrier Synchronization 13: Parallel Speedup, Critical Path, Amdahl's Law | Module 1: Sections 3.3, 3.4Section 1.5 | Topic 31.3 5 Lecture , Topic 31.3 Demonstration, Topic 3.4 Lecture , Topic 3.4 Demonstration | worksheet11 | 5 Demonstration | worksheet13 | lec13lec11-slides | WS13-solution | ||||||||||||||
| Fri | Feb 2611 | Lecture 12: Parallelism in Java Streams, Parallel Prefix Sums | Module 1: Section 3.7 | Topic Topic 3.7 Java Streams, Topic 3.7 Java Streams Demonstration | worksheet12 | lec12-slides | No class: Spring Recess
| Quiz for Unit 2 | |||||||||||||||
| 6 | Mon | Feb 14 | Lecture 14: Accumulation and reduction. Finish accumulators | Module 1: Section 2.3 | Topic 2.3 Lecture Topic 2.3 Demonstration | worksheet14 | lec14-slides | WS14-solution | ||||||||||||||||
| Wed | Feb 16 | Lecture 15: Recursive Task Parallelism | worksheet15 | lec15-slides | Mar 01 | Spring "Sprinkle" Day (no class) |
| WS15-solution | |||||||||||||||
| Wed | Fri | Mar 03Feb 18 | Lecture | 13: Iterative Averaging Revisited, SPMD pattern16: Data Races, Functional & Structural Determinism | Module 1: Sections 32.5, 32.6 | Topic | 32.5 Lecture , Topic | 32.5 Demonstration, Topic | 32.6 Lecture, Topic | 32.6 Demonstration | worksheet13worksheet16 | lec13lec16-slides | Homework 3 | (includes one intermediate checkpoint)Homework 2 | WS16-solution | |||||||||
7 | Mon | Feb 21 | Lecture 17: Midterm Review | lec17-slides | ||||||||||||||||||||
| Wed | Feb 23 | Lecture 18: Limitations of Functional parallelism. | worksheet18 | lec18-slides | WS18-solution | Homework 2 | |||||||||||||||||
| Fri | Mar 05Feb 25 | Lecture | 14: Data-Driven Tasks19: Fork/Join programming model. OS Threads. Scheduler Pattern | Topic 2.7 Lecture, Topic 2.7 Demonstration, Topic 2.8 Lecture, Topic 2.8 Demonstration, | worksheet19 | lec19 | Module 1: Sections 4.5 | Topic 4.5 Lecture Topic 4.5 Demonstration | worksheet14 | lec14-slides | WS19-solution | ||||||||||||
78 | MonMar | 08Feb 28 | Lecture 15: Point-to-point Synchronization with Phasers | Module 1: Section 4.2, 4.3 | 20: Confinement & Monitor Pattern. Critical sections | Module 2: Sections 5.1, 5.2, 5.6 | Topic 5.1 Lecture, Topic 5.1 Demonstration, Topic 5Topic 4.2 Lecture, Topic 45.2 Demonstration, Topic 45.3 6 Lecture, Topic 4Topic 5.3 6 Demonstration | worksheet15worksheet20 | lec15lec20-slides | Wed | Mar 10 | Lecture 16: Midterm Review | lec16-slides | WS20-solution | ||||||||||
| Wed | Mar 02 |
| Fri | Mar 12 | Lecture 17: Pipeline Parallelism, Signal Statement, Fuzzy Barriers21: Atomic variables, Synchronized statements | Module 2: Sections 5 Module 1: Sections 4.4, 47. 12 | Topic 45.4 Lecture, Topic 45.4 Demonstration, Topic 47.1 Lecture, Topic 4.1 Demonstration | worksheet17 | 2 Lecture | worksheet21 | lec21lec17-slides | WS21-solution | |||||||||||
| 8 | MonFri | Mar 1504 | Lecture 17: Abstract vs. Real Performance22: Parallel Spanning Tree, other graph algorithms | worksheet18worksheet22 | lec18lec22-slides | Quiz for Unit Homework 4Quiz for Unit 3 | Homework 3 | WS22-solution | |||||||||||||||
9 | Mon | Wed | Mar 1707 | Lecture 19: Critical Sections, Isolated construct (start of Module 2)23: Java Threads and Locks | Module 2: Sections 57.1, 5.2, 5.6, 7.3 | Topic 57.1 Lecture, Topic 5.1 Demonstration, Topic 5.2 Lecture, Topic 5.2 Demonstration, Topic 5.6 Lecture, Topic 5.6 Demonstration | worksheet19 | 7.3 Lecture | worksheet23 | lec23lec19-slides |
| WS23-solution | ||||||||||||
| FriWed | Mar 1909 | Lecture 20: Parallel Spanning Tree algorithm, Atomic variables 24: Java Locks - Soundness and progress guarantees | Module 2: Sections 57.3, 5.4, 5.5 | Topic 5.3 Demonstration, Topic 5.4 Lecture, Topic 5.4 Demonstration, Topic 5.5 Lecture, Topic 5.5 Demonstration | worksheet20 | lec20-slides | Topic 7.5 Lecture | worksheet24 | lec24-slides |
| WS24-solutionQuiz for Unit 4 | ||||||||||||
| 9 | MonFri | Mar 2211Lecture 21: Actors | Lecture 25: Dining Philosophers Problem | Module 2: 7.6.1, 6.2 | Topic 6.1 Lecture , Topic 6.1 Demonstration , Topic 6.2 Lecture, Topic 6.2 Demonstration | worksheet21 | lec21-slides | Topic 7.6 Lecture | worksheet25 | lec25-slides |
| WS25-solution | |||||||||||
Mon | Mar 14 | No class: Spring Break | Quiz for Unit 5 |
| ||||||||||||||||||||
| Wed | Mar | 2416 | Lecture 22: Actors (contd) | Module 2: 6.3, 6.4, 6.5 | Topic 6.3 Lecture, Topic 6.3 Demonstration, Topic 6.4 Lecture , Topic 6.4 Demonstration, Topic 6.5 Lecture, Topic 6.5 Demonstration | worksheet22 | lec22-slides | Homework 3, Checkpoint-1 | No class: Spring Break |
| ||||||||||||||
| Fri | Mar 2618 | No class: Spring Break | Spring "Sprinkle" Day (no class) |
| |||||||||||||||||||
10 | Mon | Mar 21 | Lecture 26: N-Body problem, applications and implementations | worksheet26 | lec26-slides | WS26-solution | 10 | |||||||||||||||||
| MonWed | Mar | 2923 | Lecture | 23: Actors (contd)27: Read-Write Locks, Linearizability of Concurrent Objects | Module 2: 6.67.3, 7.4 | Topic | 67. | 63 Lecture, Topic | 67. | 6 Demonstration4 Lecture | worksheet27 | lec23lec27-slides |
| Quiz for Unit 5 | WS27-solution | ||||||||
| Wed Fri | Mar 3125 | Lecture 24: Java Threads, Java synchronized statement28: Message-Passing programming model with Actors | Module 2: 76.1, 76.2 | Topic 76.1 Lecture, Topic 76.1 Demonstration, Topic 6.2 Lecture | , Topic 6.2 Demonstration | worksheet28 | lec28lec24-slides | Quiz for Unit 6 |
| WS28-solution | |||||||||||||
11 | FriMon | Apr 02Mar 28 | Lecture 25: Java Threads, Java synchronized statement (contd), wait/notify29: Active Object Pattern. Combining Actors with task parallelism | Module 2: 76.13, 76.24 | Topic 6.3 Lecture, Topic 6.3 Demonstration, Topic 6.4 Topic 7.1 Lecture, Topic 76.2 Lecture4 Demonstration | worksheet29 | lec25lec29-slides |
|
| 11 | Mon | Apr 05 | Lecture 26: Java Threads (exercise) | lec26-handout | Homework 4 (includes one intermediate checkpoint) | Homework 3 (all) | WS29-solution | |||||||
| Wed | Apr 07 | Lecture 27: Java Locks | Module 2: 7.3 | Topic 7.3 Lecture | Mar 30 | Lecture 30: Task Affinity and locality. Memory hierarchy | worksheet30 | lec30lec27-slides |
| WS30-solution | |||||||||||||
| Fri | Apr | 0901 | Lecture | 28: Linearizability of Concurrent Objects31: Data-Parallel Programming model. Loop-Level Parallelism, Loop Chunking | Module 1: Sections 3.1, 3.2, 3.3 | Topic 3.1 Lecture, Topic 3.1 Demonstration , Topic 3.2 Lecture, Topic 3.2 Demonstration, Topic 3.3 Lecture, Topic 3.3 Demonstration | worksheet31 | lec31-slides | Homework 5 | Homework 4 | WS31-solution | Module 2: 7.4 | Topic 7.4 Lecture | lec28-slides |
|
| |||||||
12 | Mon | Apr 12 | Lecture 30: Safety and Liveness Properties, Java Synchronizers, Dining Philosophers Problem | Module 2: 7.5, 7.6 | Topic 7.5 Lecture, Topic 7.6 Lecture | lec30-slides | Quiz for Unit 7 | Quiz for Unit 6 | 04 | Lecture 32: Barrier Synchronization with Phasers | Module 1: Section 3.4 | Topic 3.4 Lecture, Topic 3.4 Demonstration | worksheet32 | lec32-slides |
|
| WS32-solution | |||||||
| Wed | Apr 14 | Lecture 31: Message Passing Interface (MPI), (start of Module 3) | Topic 8.1 Lecture, Topic 8.2 Lecture, Topic 8.3 Lecture | lec31 | 06 | Lecture 33: Stencil computation. Point-to-point Synchronization with Phasers | Module 1: Section 4.2, 4.3 | Topic 4.2 Lecture, Topic 4.2 Demonstration, Topic 4.3 Lecture, Topic 4.3 Demonstration | worksheet33 | lec33-slides |
| WS33-solution | |||||||||||
| Fri | Apr 16 | Lecture 32: Message Passing Interface (MPI, contd) | Topic 8.4 Lecture | 08 | Lecture 34: Fuzzy Barriers with Phasers | Module 1: Section 4.1 | Topic 4.1 Lecture, Topic 4.1 Demonstration | worksheet34 | lec34lec32-slides | Quiz for Unit 7 |
| WS34-solution | |||||||||||
13 | Mon | Apr 1911 | Lecture 33: Message Passing Interface (MPI, contd) | Topic 8.5 Lecture, Topic 8 Demonstration Video | 35: Eureka-style Speculative Task Parallelism |
| worksheet35 | lec35lec33-slides |
| Homework 4 Checkpoint-1 |
| WS35-solution | ||||||||||||
| Wed | Apr | 2113 | Lecture | 34: Task Affinity with Places36: Scan Pattern. Parallel Prefix Sum |
| worksheet36 | lec34lec36-slides | Quiz for Unit 8WS36-solution | ||||||||||||||||
| Fri | Apr | 2315 | Lecture | 35: Eureka-style Speculative Task Parallelism37: Parallel Prefix Sum applications | worksheet37 | lec35lec37-slides | ||||||||||||||||||
| 14 | Mon | Apr | 2618 | Lecture | 36: Algorithms based on Parallel Prefix (Scan) operations38: Overview of other models and frameworks | lec36lec38-slides | ||||||||||||||||||
| Wed | Apr 2820 | Lecture 3739: Course Review (Lectures 19-3438) | lec37lec39-slides | Homework 4 (all) | ||||||||||||||||||||
| Fri | Apr 30TBD22 | Lecture 40: Course Review (Lectures 19-38) | lec40-slides | Quiz for Unit 8 | Homework 5 |
Lab Schedule
Lab # | Date (20212022) | Topic | Handouts | Examples | 0 | Infrastructure Setup | lab0-handout | Handouts | Examples | |||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
1 | Jan 2610 | Infrastructure setup | lab0-handoutAsync-Finish Parallel Programming with abstract metrics lab1-handout | - | Feb 02 | No lab this week | ||||||
| 2 | Feb 09 | FuturesJan 17 | Functional Programming | lab2-handout | ||||||||
| - | Feb 16 | No lab this week (classes cancelled) | ||||||||||
3 | Jan 24 | Java Streams | 3 | Feb 23 | Cutoff Strategy and Real World Performance | lab3-handout | ||||||
| 4 | Mar 02Jan 31 | DDFsFutures | lab4- | handouthandout | ||||||||
5 | Feb 07 | Data-Driven Tasks | lab5- | handout | ||||||||
| 6 | Feb 14 | Async / Finish | lab6-handout | Mar 09 | No lab this week (Midterm exam) | |||||||
| - | Mar 16 Feb 21 | No lab this week ( Spring "Sprinkle" DayMidterm) | ||||||||||
| 5 | Mar 23 | Loop-level Parallelism | lab5-handout | lab5-intro | ||||||||
- |
| Isolated Statement and Atomic Variables | ||||||||||
| - | Actors | |||||||||||
| - |
| Java Threads, Java Locks | ||||||||||
- |
| Message Passing Interface (MPI) | ||||||||||
- |
| Apache Spark | ||||||||||
| 7 | Feb 28 | Recursive Task Cutoff Strategy | lab7-handout | |||||||||
| 8 | Mar 07 | Java Threads | lab8-handout | |||||||||
- | Mar 14 | No lab this week (Spring Break) | ||||||||||
| 9 | Mar 21 | Concurrent Lists | lab9-handout | |||||||||
| 10 | Mar 28 | Actors | lab10-handout | |||||||||
| 11 | Apr 04 | Loop Parallelism | lab11-handout | |||||||||
- | Apr 11 | No lab this week | - |
| Eureka-style Speculative Task Parallelism | |||||||
- | Java's ForkJoin Framework | Apr 18 | No lab this week |
Grading, Honor Code Policy, Processes and Procedures
...
Labs must be submitted by the following Monday Wednesday at 114:59pm30pm. Labs must be checked off by a TA.
Worksheets should be completed by the deadline listed in Canvas before the start of the following class (for full credit) so that solutions to the worksheets can be discussed in the next class.
...