Versions Compared

Key

  • This line was added.
  • This line was removed.
  • Formatting was changed.

COMP 322: Fundamentals of Parallel Programming (Spring

...

2022)

 

InstructorInstructors:

Mackale Joyner, DH 2063

Zoran Budimlić, DH 3003

Head 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-5186Undergraduate TAs:

 

 

Piazza site:

https://piazza.com/rice/spring2022/comp322

Piazza site:

https://piazza.com/class/khclqrtu2133zo (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, Th 50pm (Austin, Claire)

Wed 4:50pm 30pm - 5:45pm20pm (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.

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 instructors 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:

Lecture Schedule

 

 

...

Finally, here are some additional resources that may be helpful for you:

Week

Day

Date (2022

Lecture Schedule

 

Topic 1.1 Lecture, Topic 1.1 Demonstration WedFeb 03 Future Tasks, Functional Parallelism ("Back to the Future")Topic 2.1 Lecture, Topic 2.1 Demonstration   3Mon Map Reduce4 4    Mon 15 Loop-Level Parallelism, Parallel Matrix Multiplication  Fri 19 11: Iteration Grouping (Chunking), Barrier Synchronization 3.3 Lecture , Topic 3.3 Demonstration, Topic 3.   3Quiz for Unit 2Wed 24Topic 4.5 Lecture   Topic 4.5 6 WedMar 03 15:  Point-to-point Synchronization with Phasers42 42 43  Topic 4.3   Quiz for Unit 5 26Spring "Sprinkle" Day (no class)lec25Apr 02 27: Java Locks Apr 05 28: Linearizability of Concurrent Objects lec32lec34Quiz for Unit 7 21 35: Eureka-style Speculative Task Parallelism  24 36Algorithms based on (Scan) operations 26 37: Course Review (Lectures 19-34)

Week

Day

Date (2021)

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

Introduction

 

 

worksheet1lec1-slides  worksheet1lec1-slides

 

 

 
WS1-solution 

 

Wed

Jan 2712

Lecture 2:  Computation Graphs, Ideal Parallelism

Module 1: Sections 1.2, 1.3Topic 1.2 Lecture, Topic 1.2 Demonstration, Topic 1.3 Lecture, Topic 1.3 Demonstrationworksheet2lec2-slides

Homework 1

 

Functional Programming

GList.java worksheet2lec02-slides

 

 

WS2-solution  
 FriJan 2914Lecture 3: Abstract Performance Metrics, Multiprocessor SchedulingModule 1: Section 1.4Topic 1.4 Lecture, Topic 1.4 Demonstrationworksheet3 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.5Topic 1.5 Lecture, Topic 1.5 Demonstrationworksheet4lec4-slidesQuiz for Unit 1   WS4-solution 

 

Fri

Jan 21

Lecture 5:

Java Streams

  Module 1: Section 2.1worksheet5lec5-slidesHomework 1 WS5-solution 
3FriMonFeb 05Jan 24

Lecture 6:   Finish Accumulators Map Reduce with Java Streams

Module 1: Section 2.34Topic 2.3 4 Lecture, Topic 2.3 4 Demonstration  worksheet6lec6-slides

 

 WS6-solution 

 

Wed

Jan 26

Feb 08

Lecture 7:

Futures

Module 1: Section 2.41Topic 2.1 Lecture , Topic 2.1 Demonstrationworksheet7lec7-slidesHomework 2

 

Homework 1 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.63Topic 1.2 .5 Lecture, Topic 1.2 .5 Demonstration, Topic 21.6 3 Lecture, Topic 21.6 3 Demonstration   worksheet8lec8-slides  Quiz for Unit 1WS8-solution  

4

Mon

 

Fri

Feb 12

Jan 31 Lecture 9: Java’s Fork/Join LibraryAsync, Finish, Data-Driven Tasks 

Module 1:

Sections 2

Section 1.

7

1,

2

4.

8

5

 

Topic

2

1.

7 Lecture

1 Lecture, Topic 1.1 Demonstration, Topic

2

4.

8 Lecture

5 Lecture, Topic 4.5 Demonstration

worksheet9

lec9-slidesslides  Quiz for Unit 2 WS9-solution 
 

4

WedFeb 02Lecture 10: Event-based programming model

 

  Module 1: Sections 3.1, 3.2Topic 3.1 Lecture , Topic 3.1 Demonstration ,  Topic 3.2 Lecture,  Topic 3.2 Demonstration worksheet10lec10-slides  WS10-solution 
 WedFriFeb 17Spring "Sprinkle" Day (no class)04Lecture 11: GUI programming as an example of event-based,
futures/callbacks in GUI programming
   worksheet11   lec11-slidesHomework 2Homework 1WS11-solution  
5

Mon

Feb

07

Lecture 12: Scheduling/executing computation graphs
Abstract performance metrics
Module 1: Sections 3.3, 3Section 1.4Topic 1.4 Lecture , Topic 1.4 Demonstrationworksheet11worksheet12lec11lec12-slides  WS12-solution 

 

5

MonWed

Feb 2209

Lecture 12:  Parallelism in Java Streams, Parallel Prefix Sums 13: Parallel Speedup, Critical Path, Amdahl's Law

Module 1: Section 31.75

Topic

Topic 3.7 Java Streams

1.5 Lecture , Topic

3

1.

7 Java Streams

5 Demonstration

worksheet12worksheet13lec12lec13-slides   WS13-solution 

 

Fri

Feb

11

Lecture 13: Iterative Averaging Revisited, SPMD pattern

Module 1: Sections 3.5, 3.6Topic 3.5 Lecture , Topic 3.5 Demonstration , Topic 3.6 Lecture,   Topic 3.6 Demonstrationworksheet13lec13-slides

Homework 3 (includes one intermediate checkpoint)

Quiz for Unit 3

Homework 2  

 

Fri

Feb 26

Lecture 14: Data-Driven Tasks 

Module 1: Sections 4.5No class: Spring Recess

 

        
6

Mon

Feb 14

Lecture 14: Accumulation and reduction. Finish accumulators

Module 1: Section 2.3Topic 2.3 Lecture   Topic 2.3 Demonstrationworksheet14lec14-slides  WS14-solution 

 

Wed

MonMar 01Feb 16

Lecture 15: Recursive Task Parallelism  

 Spring "Sprinkle" Day (no class)  worksheet15 lec15-slides

 

 

 WS15-solution 
 FriFeb 18

Lecture

16: Data Races, Functional & Structural Determinism

Module 1: Section 4Sections 2.5, 2, 4.36Topic 2.5 Lecture ,  Topic 2.5 Demonstration,  Topic 2.6 Lecture,  Topic 2.6 Demonstrationworksheet15worksheet16 lec15lec16-slidesHomework 3 Homework 2WS16-solution 

 7

FriMon

Mar 05Feb 21

Lecture 16: Pipeline Parallelism, Signal Statement, Fuzzy Barriers

Module 1: Sections 4.4, 4.1Topic 4.4 Lecture ,   Topic 4.4 Demonstration, Topic 4.1 Lecture,  Topic 4.1 Demonstrationworksheet16lec16-slidesQuiz for Unit 4

17: Midterm Review

   lec17-slides  Quiz for Unit 3  

7 

MonWed

Mar 08Feb 23

Lecture 17: Midterm Review18: Limitations of Functional parallelism.
Abstract vs. real performance. Cutoff Strategy

   worksheet18lec17lec18-slides   WS18-solution 

 

WedFriMar 10

Feb 25 

Lecture 18: Abstract vs. Real Performance

  worksheet18

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, worksheet19lec19-slides  WS19-solution 

8

Mon

Feb 28

Lecture 20: Confinement & Monitor Pattern. Critical sections
Global lock

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 Demonstrationworksheet20lec20-slides      lec18-slides    WS20-solution 

 

FriWed

Mar 1202

Lecture 19: Critical Sections, Isolated construct (start of Module 2)21:  Atomic variables, Synchronized statements

Module 2: Sections 5.

1

4,

5

7.2

, 5.6,

Topic 5.1 4 Lecture, Topic 5.1 Demonstration, Topic 5.2 Lecture, Topic 5.2 Demonstration, Topic 5.6 Lecture, Topic 5.6 Demonstrationworksheet19lec19-slides 4 Demonstration, Topic 7.2 Lectureworksheet21lec21-slides  WS21-solutionHomework 3, Checkpoint-1 

 

8

MonFri

Mar 1504

Lecture 2022: Parallel Spanning Tree algorithm, Atomic variables , other graph algorithms 

  worksheet22lec22-slidesHomework 4

Homework 3

WS22-solution 

9

Mon

Mar 07

Lecture 23: Java Threads and Locks

Module 2: Sections 57.31, 5.4, 5.57.3

Topic

5.3 Demonstration, Topic 5.4

7.1 Lecture, Topic

5.4 Demonstration, Topic 5.5 Lecture, Topic 5.5 Demonstration
worksheet20

7.3 Lecture

worksheet23 lec23lec20-slides  

 

 
WS23-solution 

 

Wed

Mar 1709

Lecture 21: Actors24: Java Locks - Soundness and progress guarantees  

Module 2: 6.1, 6.27.5Topic 67.1 Lecture ,   Topic 6.1 Demonstration ,   Topic 6.2 Lecture, Topic 6.2 Demonstrationworksheet21 5 Lecture worksheet24 lec24lec21-slides 

 

 
WS24-solution 

 

Fri

Mar 1911

Lecture 22: Actors (contd)

Module 2: 6.3, 6.4, 6.5Topic 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 

Quiz for Unit 4

  

9

Mon

Mar 22

Lecture 23: Actors (contd)

Module 2: 6.6Topic 6.6 Lecture, Topic 6.6 Demonstration lec23-slides Lecture 25: Dining Philosophers Problem  Module 2: 7.6Topic 7.6 Lectureworksheet25lec25-slides 

 

WS25-solution 
 

Mon

Mar 14

No class: Spring Break

     

 

  
 WedMar 2416

Lecture 24: Java Threads, Java synchronized statement

Module 2: 7.1, 7.2Topic 7.1 Lecture, Topic 7.2 Lecture No class: Spring Break   lec24-slides  

 

   

 

Fri

Mar

18

No class: Spring Break

     

 

  

10

Mon

Mar 2921

Lecture 25: Java Threads, Java synchronized statement (contd), wait/notify

Module 2: 7.1, 7.2Topic 7.1 Lecture, Topic 7.2 Lecture 

26: N-Body problem, applications and implementations 

  worksheet26lec26-slides    WS26-solution 

 

Wed

Mar 3123

Lecture 26: Java Threads (exercise)

   lec26-handout  Homework 3 (all) 

27: Read-Write Locks, Linearizability of Concurrent Objects

Module 2: 7.3, 7.4Topic 7.3 Lecture, Topic 7.4 Lectureworksheet27lec27-slides

 

 WS27-solution 

 

Fri

Mar 25

Lecture

28: Message-Passing programming model with Actors

Module 2: 7.3Topic 7.3 Lecture  lec27-slides

Quiz for Unit 6

Quiz for Unit 5 6.1, 6.2Topic 6.1 Lecture, Topic 6.1 Demonstration,   Topic 6.2 Lecture, Topic 6.2 Demonstration worksheet28lec28-slides

 

 

 

WS28-solution 

11

Mon

Mar 28

Lecture

29: Active Object Pattern. Combining Actors with task parallelism 

Module 2: 76.3, 6.4Topic 7Topic 6.3 Lecture, Topic 6.3 Demonstration,   Topic 6.4 Lecture, Topic 6.4 Demonstrationworksheet29lec29-slides lec28-slides Homework 4 (includes one intermediate checkpoint)

 

 

WS29-solution 

 

WedApr

07Mar 30

Lecture 29:  Java Locks (exercise)30: Task Affinity and locality. Memory hierarchy 

   worksheet30lec29lec30-handout slides

 

  WS30-solution 

 

Fri

Apr 0901

Lecture 30: Safety and Liveness Properties, Java Synchronizers, Dining Philosophers Problem

Module 2: 7.5, 7.6Topic 7.5 Lecture, Topic 7.6 Lecture lec30-slides

Quiz for Unit 7

Quiz for Unit 6

31: Data-Parallel Programming model. Loop-Level Parallelism, Loop Chunking

Module 1: Sections 3.1, 3.2, 3.3Topic 3.1 Lecture, Topic 3.1 Demonstration , Topic 3.2 Lecture,  Topic 3.2 Demonstration, Topic 3.3 Lecture,  Topic 3.3 Demonstrationworksheet31lec31-slidesHomework 5

Homework 4

WS31-solution  

12

Mon

Apr 1204

Lecture 31: Message Passing Interface (MPI), (start of Module 3) Topic 8.1 Lecture, Topic 8.2 Lecture, Topic 8.3 Lecture 32: Barrier Synchronization with PhasersModule 1: Section 3.4Topic 3.4 Lecture,  Topic 3.4 Demonstrationworksheet32lec32lec31-slides

 

 

WS32-solution 

 

 

Wed

Apr 14

Lecture 32: Message Passing Interface (MPI, contd)

 Topic 8.4 Lecture  

Wed

Apr 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

worksheet33lec33-slides

 

Homework 4 Checkpoint-1

 WS33-solution  

 

Fri

Apr 16

Lecture 33: Message Passing Interface (MPI, contd)

 Topic 8.5 Lecture, Topic 8 Demonstration Video 

08

Lecture 34: Fuzzy Barriers with Phasers

Module 1: Section 4.1Topic 4.1 Lecture, Topic 4.1 Demonstrationworksheet34lec34lec33-slides 

 

 
WS34-solution 

13

Mon

Apr 1911

Lecture 34: Task Affinity with Places35: Eureka-style Speculative Task Parallelism 

 

 worksheet35lec35-slides

  Quiz for Unit 8

 

 

WS35-solution 
 WedApr 13Lecture 36: Scan Pattern. Parallel Prefix Sum 

 

 
worksheet36lec35lec36-slides  WS36-solution 
 FriApr 15Lecture 37: Parallel Prefix Sum applications   worksheet37lec36lec37-slides    
14MonApr 18Lecture 38: Overview of other models and frameworks   lec37lec38-slides    
 WedApr 28TBD20Lecture 39: Course Review (Lectures 19-38)   lec39-slides  Homework 4 (all)  
 FriApr 30TBD22Lecture 40: Course Review (Lectures 19-38)    lec40-slides Quiz for Unit 8Homework 5  

Lab Schedule

 -FuturesFeb 23DDFs-handout Mar 16Spring "Sprinkle" Day-Message Passing Interface (MPIApache Spark-Java's ForkJoin Framework

Lab #

Date (20212022)

Topic

Handouts

Examples

0 Infrastructure Setuplab0-handout

1

Jan 2610

Infrastructure setup

lab0-handoutAsync-Finish Parallel Programming with abstract metrics

lab1-handout

 
Feb 02No lab this week  2

Feb 09

Jan 17Functional Programminglab2-handout 

3

Feb 16

Jan 24

Java Streams

Cutoff Strategy and Real World Performance

lab3-handout
 
4Jan 31Futureslab4 -Mar 02No lab this week-handout  

5

Mar 09Feb 07Loop

Data-

level Parallelism

Driven Tasks

lab5-handout lab5-introhandout 
6

Feb 14

Async / Finish

lab6-handout 
-

Feb 21

No lab this week (

Midterm)

  
-7

 

Isolated Statement and Atomic Variables

  Feb 28Recursive Task Cutoff Strategylab7-handout- Actors  
8 Mar 07Java Threads, Java Lockslab8-handout  

-

 

Mar 14

No lab this week (Spring Break)

  
9Mar 21Concurrent Listslab9-handout 
10Mar 28Actorslab10-handout  
11

Apr 04

Loop Parallelism

lab11-handout 

-

Apr 11

No lab this weekEureka-style Speculative Task Parallelism

  

-

 

Apr 18

No lab this week

  

Grading, Honor Code Policy, Processes and Procedures

Grading will be based on your performance on five homeworks four homework assignments (weighted 40% in all), two exams (weighted 40% in all), weekly lab exercises (weighted 10% in all), online quizzes (weighted 5% in all), and in-class worksheets (weighted 5% in all).

The purpose of the homeworks homework is to give you practice in solving problems that deepen your understanding of concepts introduced in class. Homeworks are Homework is due on the dates and times specified in the course schedule.  No late submissions (other than those using slip days mentioned below) will be accepted.

The slip day policy for COMP 322 is similar to that of COMP 321. All students will be given 3 slip days to use throughout the semester. When you use a slip day, you will receive up to 24 additional hours to complete the assignment. You may use these slip days in any way you see fit (3 days on one assignment, 1 day each on 3 assignments, etc.). Slip days will be automatically tracked through the Autograder, more details are available later in this document and in the Autograder user guideusing the README.md file. Other than slip days, no extensions will be given unless there are exceptional circumstances (such as severe sickness, not because you have too much other work). Such extensions must be requested and approved by the instructor (via e-mail, phone, or in person) before the due date for the assignment. Last minute requests are likely to be denied.be denied.

Labs must be submitted by the following Wednesday at 4:30pm.  Labs Labs must be checked off by a TA by the following Monday at 11:59pm.

Worksheets should be completed in class for full credit.  For partial credit, a worksheet can be turned in before the start of the class following the one in which the worksheet for distributed, by the deadline listed in Canvas so that solutions to the worksheets can be discussed in the next class.

You will be expected to follow the Honor Code in all homeworks and homework and exams.  The following policies will apply to different work products in the course:

  • In-class worksheets: You are free to discuss all aspects of in-class worksheets with your other classmates, the teaching assistants and the professor during the class. You can work in a group and write down the solution that you obtained as a group. If you work on the worksheet outside of class (e.g., due to an absence), then it must be entirely your individual effort, without discussion with any other students.  If you use any material from external sources, you must provide proper attribution.
  • Weekly lab assignments: You are free to discuss all aspects of lab assignments with your other classmates, the teaching assistants and the professor during the lab.  However, all code and reports that you submit are expected to be the result of your individual effort. If you work on the lab outside of class (e.g., due to an absence), then it must be entirely your individual effort, without discussion with any other students.  If you use any material from external sources, you must provide proper attribution (as shown here).
  • HomeworksHomework: All submitted homeworks are homework is expected to be the result of your individual effort. 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 external sources, you must provide proper attribution.
  • Quizzes: Each online quiz will be an open-notes individual test.  The student may consult their course materials and notes when taking the quizzes, but may not consult any other external sources.
  • Exams: Each exam will be a closedopen-book, closedopen-notes, and closedopen-computer individual written test, which must be completed within a specified time limit.  No class notes or external materials may be consulted when taking the exams.

...