COMP 322: Fundamentals of Parallel Programming (Spring
...
2023)
InstructorsInstructor: | Mackale Joyner, DH 2063 Zoran Budimlić, DH 1038 | TAs: | Adrienne Li, Austin Hushower, Claire Xu, Diep Hoang, Hunena Badat, Maki Yu, Mantej Singh, Rose Zhang, Victor Song, Yidi Wang |
|---|---|---|---|
| Admin Assistant: | Annepha Hurlock, annepha@rice.edu, DH 3122, 713-348-5186 |
| |
| Mohamed Abead, Chase Hartsell, Taha Hasan, Harrison Huang, Jerry Jiang, Jasmine Lee, Michelle Lee, Hung Nguyen, Quang Nguyen, Ryan Ramos, Oscar Reynozo, Delaney Schultz, Tina Wen, Raiyan Zannat, Kailin Zhang | |||
Piazza site: | https://piazza.com/rice/spring2022/comp322 (Piazza is the preferred medium for all course communications) | Cross-listing: | ELEC 323 |
Lecture location: | Herzstein Amphitheater (online 1st 2 weeks)TBD | Lecture times: | MWF 1:00pm - 1:50pm |
Lab locations: | Keck 100 (online 1st 2 weeks)TBD | Lab times: | Mon 3:00pm - 3:50pm () Wed Tue 4:30pm 00pm - 54:20pm 50pm () |
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 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.
...
- Module 1 handout (Parallelism)
- Module 2 handout (Concurrency)There is no lecture handout for Module 3 (Distribution and Locality). The instructor will refer you to optional resources to supplement the lecture slides and videos.
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
Lecture Schedule
Finally, here are some additional resources that may be helpful for you:
- Slides titled "MPI-based Approaches for Java" by Bryan Carpenter
Lecture Schedule
WeekWeek | Day | Date (2022) | Lecture | Assigned Reading | Assigned Videos (see Canvas site for video links) | In-class Worksheets | Slides | Work Assigned | Work Due | Worksheet Solutions | ||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1 | Mon | Jan 1009 | 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 1211 | 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 1413 | 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 1716 | Lecture 4: Parallel Speedup and Amdahl's Law | Module 1: Section 1.5 | Topic 1.5 Lecture, Topic 1.5 Demonstration | worksheet4 | lec4-slides | No class: MLK | Quiz for Unit 1 | |||||||||||||||||
| Wed | Jan 1918 | Lecture 5: Future Tasks, Functional Parallelism ("Back to the Future") | Module 1: Section 2.1 | Topic 2.1 Lecture, Topic 2.1 Demonstration | worksheet5 | 4: Lazy Computation | LazyList.java Lazy.java | worksheet4 | lec4lec5-slides | WS4-solution | |||||||||||||||
| Fri | Jan 2120 | Lecture 65: Java Streams | Finish Accumulators | Module 1: Section 2.3 | Topic 2.3 Lecture, Topic 2.3 Demonstration | worksheet6 | lec6-slides | Quiz for Unit 1 | worksheet5 | lec5-slides | Homework 1 | WS5-solution | |||||||||||||
| 3 | Mon | Jan 2423 | Lecture 76: Map Reduce with Java Streams | Module 1: Section 2.4 | Topic 2.4 Lecture, Topic 2.4 Demonstration | worksheet7worksheet6 | lec7lec6-slides |
| WS6-solution | |||||||||||||||||
| Wed | Jan 2625 | Lecture 8: Data Races, Functional & Structural Determinism7: Futures | Module 1: Section 2.5, 2.61 | Topic 2.5 1 Lecture , Topic 2.5 Demonstration, Topic 2.6 Lecture, Topic 2.6 Demonstration | worksheet8 | 1 Demonstration | worksheet7 | lec7lec8-slides | Homework 2 | Homework 1 | WS7-solution | ||||||||||||||
| Fri | Jan 2827 | Lecture 9: Java’s Fork/Join Library | Topic 2.7 Lecture, Topic 2.7 Demonstration, Topic 2.8 Lecture, Topic 2.8 Demonstration | worksheet9 | lec9-slides | Quiz for Unit 2 | 8: 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 | worksheet8 | lec8-slides | WS8-solution | |||||||||||||
4 | Mon
| Jan 3130 | Lecture 9: Async, Finish, Data-Driven Tasks | Module 1: Section 1.1, 4.5
| Topic 1.1 Lecture, Topic 1.1 Demonstration, Topic 4.5 Lecture, Topic 4.5 Demonstration | worksheet9 | lec9-slides | WS9-solution | ||||||||||||||||||
| Wed | Feb 0201 | Lecture 10: Event-based programming model
| worksheet10 | lec10-slides | Homework 1 | WS10-solution | ||||||||||||||||||||
| Fri | Feb 04 | 03 | Lecture 11: GUI programming as an example of event-based, futures/callbacks in GUI programming | worksheet11 | lec11-slides | Homework 2 | WS11-solution | |||||||||||||||||||
| 5 | Mon | Feb 0706 | 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 31.1 Demonstration , Topic 3.2 Lecture, Topic 3.2 Demonstration | worksheet10 | 4 Demonstration | worksheet12 | lec12lec10-slides | WS12-solution | ||||||||||||||||
| Wed | Feb 0908 | 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 1110 | No class: Spring Recess Lecture 12: Data-Driven Tasks | Module 1: Sections 4.5 | Topic 4.5 Lecture Topic 4.5 Demonstration | worksheet12 | lec12-slides | Quiz for Unit 2 | ||||||||||||||||||
| 6 | Mon | Feb 14 |
| 13 | 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 1615 | Lecture 1315: Parallelism in Java Streams, Parallel Prefix Sums | Module 1: Sections 3.7 | Topic 3.7 Lecture , Topic 3.7 Demonstration | worksheet13 | lec13-slides | Homework 3 (includes one intermediate checkpoint)
| Homework 2 | Recursive Task Parallelism | worksheet15 | lec15-slides |
| WS15-solution | ||||||||||||
| Fri | Feb 1817 | Lecture 14: 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 | worksheet14 worksheet16 | lec14lec16-slides | Quiz for Unit Homework 3 | Homework 2 | WS16-solution | |||||||||||||||||
7 | Mon | Feb 2120 | Lecture 1517: 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 | worksheet15 | Midterm Review | lec17lec15-slides | ||||||||||||||||||
| Wed | Feb 2322 | Lecture 16: Midterm Review18: Limitations of Functional parallelism. | worksheet18 | lec16lec18-slides | WS18-solution | ||||||||||||||||||||
| Fri | Feb 25 24 | Lecture 17: Pipeline Parallelism, Signal Statement, Fuzzy Barriers | Module 1: Sections 4.4, 4.1 | Topic 4.4 Lecture , Topic 4.4 Demonstration, Topic 4.1 Lecture, Topic 4.1 Demonstration | worksheet17 | 19: 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 | lec19lec17-slides | WS19-solution | |||||||||||||||
8 | Mon | Feb 2827 | Lecture 18: Abstract vs. Real Performance | worksheet18 | lec18-slides | Quiz for Unit 4 | Quiz for Unit 3 | 20: Confinement & Monitor Pattern. Critical sections | Module 2: Sections 5.1, 5.2, 5.6 | Topic 5.1 Lecture, Topic 5.1 |
| Wed | Mar 02 | Lecture 19: Critical Sections, Isolated construct (start of Module 2) | Module 2: Sections 5.1, 5.2, 5.6, | Topic 5.1 Lecture, Topic 5.1 Demonstration, Topic 5.2 Lecture, Topic 5.2 Demonstration, Topic 5.6 Lecture, Topic 5.6 Demonstration | worksheet19worksheet20 | lec19lec20-slides | WS20-solution | |||||||
| FriWed | Mar 0401 | Lecture 20: Parallel Spanning Tree algorithm, 21: Atomic variables, Synchronized statements | Module 2: Sections 5.3,5.4, 57. 52 | Topic 5.3 Demonstration, Topic 5.4 Lecture, Topic 5.4 Demonstration, Topic 57.5 Lecture, Topic 5.5 Demonstration | worksheet20 | lec20-slides | 2 Lecture | worksheet21 | lec21-slides | WS21-solutionQuiz for Unit 4 | |||||||||||||||
| Fri | Mar 03 | Lecture 22: Parallel Spanning Tree, other graph algorithms | worksheet22 | lec22-slides | Homework 4 | Homework 3 | WS22-solution | ||||||||||||||||||
9 | Mon | Mar 06 | Lecture 23: Java Threads and Locks | 9 | Mon | Mar 07 | Lecture 21: Actors | Module 2: 6Sections 7.1, 67.23 | Topic 67.1 Lecture, Topic 6.1 Demonstration , Topic 6.2 Lecture, Topic 6.2 Demonstration | worksheet21 | lec21-slides | Quiz for Unit 5 |
| 7.3 Lecture | worksheet23 | lec23-slides |
| WS23-solution | ||||||||
| Wed | Mar 0908 | Lecture 22: Actors (contd)24: Java Locks - Soundness and progress guarantees | Module 2: 6.3, 6.47.5 | Topic 67.3 Lecture, Topic 6.3 Demonstration, Topic 6.4 Lecture , Topic 6.4 Demonstration | worksheet22 | lec22-slides | Homework 3, Checkpoint-1 | 5 Lecture | worksheet24 | lec24-slides |
| WS24-solution | |||||||||||||
| Fri | Mar 11 | 10 | Lecture 25: Dining Philosophers Problem | Module 2: 7.6 | Topic 7.6 Lecture | worksheet25 | lec25-slides |
| WS25-solution | ||||||||||||||||
Mon | Mar 1413 | Lecture 23: Actors (contd) | Module 2: 6.5, 6.6 | Topic 6.5 Lecture, Topic 6.5 Demonstration, Topic 6.6 Lecture, Topic 6.6 Demonstration | worksheet23 | lec23-slides | No class: Spring Break | Quiz for Unit 5 | ||||||||||||||||||
| Wed | Mar 16 | Lecture 24: Java Threads, Java synchronized statement | Module 2: 7.1, 7.2 | Topic 7.1 Lecture, Topic 7.2 Lecture | worksheet24 | lec24-slides | 15 | No class: Spring Break | Quiz for Unit 6 | |||||||||||||||||
| Fri | Mar 18 | Lecture 25: Java Threads, Java synchronized statement (contd), wait/notify | Module 2: 7.1, 7.2 | Topic 7.1 Lecture, Topic 7.2 Lecture | worksheet25 | Fri | Mar 17 | No class: Spring Break | lec25-slides |
| |||||||||||||||
10 | Mon | Mar 2120 | Lecture 26: Java Locks | Module 2: 7.3 | N-Body problem, applications and implementations | Topic 7.3 Lecture | worksheet26 | lec26-slides | Homework 4 (includes one intermediate checkpoint) | Homework 3 (all) | WS26-solution | |||||||||||||||
| Wed | Mar 2322 | Lecture 27: Read-Write Locks, Linearizability of Concurrent Objects | Module 2: 7.3, 7.4 | Topic 7.3 Lecture, Topic 7.4 Lecture | worksheet27 | lec27-slides |
| WS27-solution | |||||||||||||||||
| Fri | Mar 25 | Lecture 28: Safety and Liveness Properties, Java Synchronizers, Dining Philosophers Problem | 24 | Lecture 28: Message-Passing programming model with Actors | Module 2: 6.1, 6.2 | Topic 6.1 Lecture, Topic 6.1 Demonstration, Topic 6.2 Lecture, Topic 6.2 Demonstration Topic 7.5 Lecture, Topic 7.6 Lecture | worksheet28 | lec28-slides | Quiz for Unit 7 |
| WS28-solution | ||||||||||||||
11 | Mon | Mar 2827 | Lecture 29: Message Passing Interface (MPI), (start of Module 3) | Active Object Pattern. Combining Actors with task parallelism | Module 2: 6.3, 6.4 | Topic 6.3 Lecture, Topic 6.3 Demonstration, Topic 6.4 Lecture, Topic 6.4 DemonstrationTopic 8.1 Lecture, Topic 8.2 Lecture, Topic 8.3 Lecture | worksheet29 | lec29-slides |
| Quiz for Unit 6 |
| WS29-solution | ||||||||||||||
| Wed | Mar 3029 | Lecture 30: Message Passing Interface (MPI, contd) Task Affinity and locality. Memory hierarchy | Topic 8.4 Lecture | worksheet30 | lec30-slides |
| WS30-solution | ||||||||||||||||||
| FriApr | 01Mar 31 | Lecture 31: Message Passing Interface (MPI, contd) | 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 Topic 8.5 Lecture, Topic 8 Demonstration Video | worksheet31 | lec31-slides | Quiz for Unit 8 | Quiz for Unit 7 | Homework 5 | Homework 4 | WS31-solution | |||||||||||||
12 | Mon | Apr 0403 | Lecture 32: Task Affinity with Places | Barrier Synchronization with Phasers | Module 1: Section 3.4 | Topic 3.4 Lecture, Topic 3.4 Demonstration | worksheet32 | lec32-slides |
| Homework 4 Checkpoint-1 |
| WS32-solution | ||||||||||||||
| Wed | Apr 0605 | Lecture 33: Eureka-style Speculative Task Parallelism | 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 0807 | Lecture 34: Algorithms based on Parallel Prefix (Scan) operations | Fuzzy Barriers with Phasers | Module 1: Section 4.1 | Topic 4.1 Lecture, Topic 4.1 Demonstration | worksheet34 | lec34-slides | Quiz for Unit 8 |
| WS34-solution | |||||||||||||||
13 | Mon | Apr 1110 | Lecture 35: Message-Passing programming model with Actors Eureka-style Speculative Task Parallelism |
| worksheet35 | lec35-slides |
|
| WS35-solution | |||||||||||||||||
| Wed | Apr 1312 | Lecture 36: Active Object Scan Pattern. Combining Actors with task parallelismParallel Prefix Sum |
| worksheet36 | lec36-slides | Homework 4 (all) | WS36-solution | |||||||||||||||||||
| Fri | Apr 1514 | Lecture 37: Eureka-style Speculative Task Parallelism Parallel Prefix Sum applications | worksheet37 | lec37-slides | ||||||||||||||||||||||
| 14 | Mon | Apr 1817 | Lecture 38: Overview of other models and frameworks | lec38-slides | ||||||||||||||||||||||
| Wed | Apr 2019 | Lecture 39: Course Review (Lectures 19-38) | lec39-slides | |||||||||||||||||||||||
| Fri | Apr 2221 | Lecture 40: Course Review (Lectures 19-38) | lec40-slides | Homework 5 |
Lab Schedule
Lab # | Date (20212023) | Topic | Handouts | Examples | 0||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
1 | Jan 09 | Infrastructure | Setupsetup | lab0-handout | 1 | Jan 10 | Async-Finish Parallel Programming with abstract metrics | lab1-handout | ||||
| - | Jan 17 16 | No lab this week (MLK) | ||||||||||
| 2 | Jan | 2423 | FuturesFunctional Programming | lab2-handout | ||||||||
3 | Jan | 3130 | Java Streams | lab3-handout | 3 | |||||||
| 4 | Feb | 0706 | Futures | lab4 | Cutoff Strategy and Real World Performance | lab3-handout | ||||||
| 4 5 | Feb 14 | DDFs | 13 | Data-Driven Tasks | lab5-handoutlab4-handout | |||||||
| - | Feb 2120 | No lab this week (Midterm exam) | ||||||||||
| 6 | Feb | 2827 | Async / Finish | lab6 | 5 | Mar 07 | Loop-level Parallelism | lab5-handout | lab5-intro||||
| 67 | Mar 14 | Isolated Statement and Atomic Variables | 06 | Recursive Task Cutoff Strategy | lab7lab6-handout | |||||||
| - | Mar 21 13 | No lab this week (Spring Break) | ||||||||||
| 78 | Mar 2820 | Java Threads, Java Locks | lab7-handout | 8 | Apr 04 | Actors | lab8-handout | |||||
| 9 | Apr 11 | Message Passing Interface (MPI) | Mar 27 | Concurrent Lists | lab9-handout | |||||||
| 10 | Apr | 1803 | Apache Spark | Actors | lab10-handout | |||||||
| 11 |
| Eureka-style Speculative Task Parallelism | Apr 10 | Loop Parallelism | lab11-handout | |||||||
- | Java's ForkJoin Framework | Apr 17 | 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.
...