Versions Compared

Key

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

COMP 322: Fundamentals of Parallel Programming (Spring

...

2023)

 

Instructor:

Mackale Joyner, DH 2063

Head TAs: Admin Assistant:Annepha Hurlock, annepha@rice.edu, DH 3122, 713-348-5186Undergraduate TAs: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/classrice/spring2022/khclqrtu2133zocomp322 (Piazza is the preferred medium for all course communications)

Cross-listing:

ELEC 323

Lecture location:

Fully OnlineTBD

Lecture times:

MWF 1:30pm 00pm - 21:25pm50pm

Lab locations:

Fully OnlineTBD

Lab times:

Tu 1Mon  3:30pm 00pm - 2:25pm, Th 3:50pm ()

Tue 4:50pm 00pm - 54:45pm50pm ()

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: creation and  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

...

There are also a few optional textbooks that we will draw from during the 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

 

 

19 Iteration Grouping (Chunking), Barrier Synchronization Topic 3.3 Lecture , Topic 3.3 Demonstration, Topic 3.4 Lecture  ,   Topic 3.4 Demonstration    22  Parallelism in Java Streams, Parallel Prefix Sums Topic 3.7 Java Streams 37 Java Streams   24 Iterative Averaging Revisited, SPMD pattern 3 3 , Topic 3.6 Lecture,   Topic 3.6 DemonstrationHomework 2Fri 26 Data-Driven Tasks 45 45 6 WedMar 03 15:  Point-to-point Synchronization with Phasers42 42 43  Topic 4.3    24 Java Threads, Java synchronized statement 10Mon 29Homework 3, Checkpoint-2Apr 05 28

Homework 4 (includes one intermediate checkpoint)

 

Homework 3 (all)lec31Mon 19 34: Task Affinity with Placeslec34 Quiz for Unit 8 Wed 21 35: Eureka-style Speculative Task Parallelism Fri 24 36: Algorithms based on Parallel Prefix (Scan) operationsHomework 4 (all)14Mon 26 3734Quiz for Unit 8

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 2509

Lecture 1: Task Creation and Termination (Async, Finish)

Module 1: Section 1.1

Introduction

 

 Topic 1.1 Lecture, Topic 1.1 Demonstration

worksheet1lec1-slidesslides  

 

 

 
WS1-solution 

 

Wed

Jan 2711

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 2913Lecture 3: Abstract Performance Metrics, Multiprocessor SchedulingModule 1: Section 1.4Topic 1.4 Lecture, Topic 1.4 Demonstrationworksheet3lec3-slides Higher order functions  worksheet3 lec3-slides   

 

 WS3-solution 

2

Mon

Feb 01

Lecture 4: Parallel Speedup and Amdahl's Law

Module 1: Section 1.5Topic 1.5 Lecture, Topic 1.5 Demonstrationworksheet4lec4-slides

Jan 16

No class: MLK

     Quiz for Unit 1   

 

WedFeb

03Jan 18

Lecture 5: Future Tasks, Functional Parallelism ("Back to the Future")Module 1: Section 2.1Topic 2.1 Lecture, Topic 2.1 Demonstrationworksheet54: Lazy Computation

LazyList.java

Lazy.java

 worksheet4lec4lec5-slides   WS4-solution 

 

FriFeb

05Jan 20

Lecture 65:   Finish Accumulators Java Streams

  worksheet5lec5-slidesHomework 1 WS5-solution 
3MonJan 23

Lecture 6: Map Reduce with Java Streams

Module 1: Section 2.3Topic 2.3 Lecture, Topic 2.3 Demonstrationworksheet6lec6-slides    3MonFeb 08

Lecture 7: Map Reduce

Module 1: Section 2.4Topic 2.4 Lecture, Topic 2.4 Demonstration  worksheet7worksheet6lec7lec6-slides

Homework 2 

Homework 1 WS6-solution  

 

WedFeb

10Jan 25

Lecture 8: Data Races, Functional & Structural Determinism7: Futures

Module 1: Section 2.5, 2.61Topic 2.5 1 Lecture , Topic 2.5 Demonstration, Topic 2.6 Lecture, Topic 2.6 Demonstration   worksheet81 Demonstrationworksheet7lec7lec8-slides

 

Quiz for Unit 1 WS7-solution  

 

FriFeb

12Jan 27

Lecture 9: Java’s Fork/Join Library8:  Computation Graphs, Ideal Parallelism

Module 1: Sections 1.2.7, 21.83Topic 1.2 .7 Lecture, Topic 2.8 Lectureworksheet9lec9-slidesQuiz for Unit 2 1.2 Demonstration, Topic 1.3 Lecture, Topic 1.3 Demonstrationworksheet8lec8-slides  WS8-solution  

4

Mon

 Feb 15

Jan 30 Lecture 10: Loop-Level Parallelism, Parallel Matrix Multiplication9: Async, Finish, Data-Driven Tasks 

Module 1:

Sections 3

Section 1.1,

3

4.

2

5

 

Topic

3

1.1 Lecture, Topic

3

1.1 Demonstration,

 

Topic

3

4.

2

5 Lecture,

 

Topic

3

4.

2

5 Demonstration

worksheet10

worksheet9

lec10lec9-slidesslides    WS9-solution 
 WedFeb 17Spring "Sprinkle" Day (no class)01Lecture 10: Event-based programming model

 

   worksheet10lec10-slides  Homework 1WS10-solution  
 FriFeb 03Lecture 11: Module 1: Sections 3.3, 3.4 GUI programming as an example of event-based,
futures/callbacks in GUI programming
  worksheet11lec11-slidesHomework 2 WS11-solution 
5

Mon

Feb

06

Lecture 12: Scheduling/executing computation graphs
Abstract performance metrics
Module Module 1: Section 31.74Topic 1.4 Lecture , Topic 1.4 Demonstrationworksheet12lec12-slides Quiz for Unit 2 WS12-solution 

 

Wed

Feb

08

Lecture 13:

Parallel Speedup, Critical Path, Amdahl's Law

Module 1: Sections 3Section 1.5, 3.6

Topic

1.5 Lecture , Topic

1.5 Demonstration

worksheet13lec13-slides

Homework 3 (includes 2 intermediate checkpoints)

Quiz for Unit 3

worksheet13lec13-slides  WS13-solution 

 

Fri

Feb 10

No class: Spring Recess

 

        
6

Mon

Feb

13

Lecture 14:

Accumulation and reduction. Finish accumulators

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

 

Wed

MonMar 01Feb 15

Lecture 15: Recursive Task Parallelism  

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

 

 

 WS15-solution 
 FriFeb 17

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 20

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

Mon

Mar 08

Lecture 17: Midterm Review

  

 

lec17-slides    

 

WedMar 10

Feb 22

Lecture 18: Limitations of Functional parallelism.
Abstract vs.
Real Performancereal performance. Cutoff Strategy

  worksheet18lec18lec18-slides    WS18-solution 

 

FriMar 12

Feb 24 

Lecture 19: Critical Sections, Isolated construct (start of Module 2)

Module 2: Sections 5.1, 5.2, 5.6,

Fork/Join programming model. OS Threads. Scheduler Pattern 

 Topic 2.7 Lecture, Topic 2.7 Demonstration, Topic 2.8 Lecture, Topic 2.8 Demonstration, Topic 5.1 Lecture, Topic 5.1 Demonstration, Topic 5.2 Lecture, Topic 5.2 Demonstration, Topic 5.6 Lecture, Topic 5.6 Demonstrationworksheet19lec19-slides  Homework 3, Checkpoint-1WS19-solution  

8

MonMar

15Feb 27

Lecture 20: Parallel Spanning Tree algorithm, Atomic variables Confinement & Monitor Pattern. Critical sections
Global lock

Module 2: Sections 5.31, 5.42, 5.56 Topic 5.1 Lecture, Topic 5.3 1 Demonstration, Topic 5.4 2 Lecture, Topic 5.4 2 Demonstration, Topic 5.5 6 Lecture, Topic 5.5 6 Demonstrationworksheet20lec20-slides         WS20-solution 

 

Wed

Mar 1701

Lecture 21: Actors  Atomic variables, Synchronized statements

Module 2:

6

Sections 5.

1

4,

6

7.2

Topic 65.1 4 Lecture,   Topic 65.1 4 Demonstration,   Topic 67.2 Lecture, Topic 6.2 Demonstrationworksheet21lec21-slides   WS21-solution 

 

Fri

Mar 1903

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

  

Parallel Spanning Tree, other graph algorithms 

  worksheet22lec22-slidesHomework 4

Homework 3

WS22-solution 

9

Mon

Mar 2206

Lecture 23: Actors (contd)Java Threads and Locks

Module 2: 6.6Sections 7.1, 7.3

Topic

6

7.

6

1 Lecture, Topic

6

7.

6 Demonstration

3 Lecture

 worksheet23 lec23-slides Quiz for Unit 5 

 

 
WS23-solution 

 

Wed

Mar

08

Lecture 24:

Java Locks - Soundness and progress guarantees  

Module 2: 7.1, 7.25Topic 7.5 Lecture worksheet24 1 Lecture, Topic 7.2 Lecture lec24-slides 

 

 WS24-solution 

 

Fri

Mar 10

 Lecture 25: Dining Philosophers Problem  Module 2: 7.6Topic 7.6 Lectureworksheet25lec25-slides 

 

WS25-solution 
 

Mon

Mar 13

No class: Spring Break

26Spring "Sprinkle" Day (no class)

     

 

  
 WedMar 15

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

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

 

   

 

WedFri

Mar 3117

Lecture 26: Java Threads (exercise)No class: Spring Break

   lec26-handout Quiz for Unit 6  

 

Quiz for Unit 5

  

 10

FriMon

Apr 02Mar 20

Lecture 27: Java Locks

Module 2: 7.3Topic 7.3 Lecture  

26: N-Body problem, applications and implementations 

  worksheet26lec26lec27-slides   WS26-solution 

 

11

Mon

Wed

Mar 22

Lecture

27: Read-Write Locks, Linearizability of Concurrent Objects

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

 

 WS27-solution 

 

 

Fri

 

Wed

Apr 07

Lecture 29:  Java Locks (exercise)

   lec29-handout  

Quiz for Unit 6

  

 

Fri

Apr 09

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

 

  

Mar 24

Lecture 28: Message-Passing programming model with Actors

Module 2: 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 27

Lecture 29: Active Object Pattern. Combining Actors with task parallelism 

Module 2: 6.3, 6.4Topic 6.3 Lecture, Topic 6.3 Demonstration,   Topic 6.4 Lecture, Topic 6.4 Demonstrationworksheet29lec29-slides

 

 

WS29-solution 

 

Wed

Mar 29

Lecture 30: Task Affinity and locality. Memory hierarchy 

  worksheet30lec30-slides

 

 WS30-solution 

 

Fri

Mar 31

Lecture 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 03

Lecture 32: Barrier Synchronization with PhasersModule 1: Section 3.4Topic 3.4 Lecture,  Topic 3.4 Demonstrationworksheet32lec32-slides

 

 

WS32-solution 

 

Wed

Apr 05

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

12

Mon

Apr 12

Lecture 31: Message Passing Interface (MPI), (start of Module 3)

 Topic 8.1 Lecture, Topic 8.2 Lecture, Topic 8.3 Lecture -slides

 

  WS33-solution 

 

WedFri

Apr 1407

Lecture 32: Message Passing Interface (MPI, contd)

 Topic 8.4 Lecture  

34: Fuzzy Barriers with Phasers

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

 

WS34-solutionHomework 4 Checkpoint-1  

13

 

FriMon

Apr 1610

Lecture 33: Message Passing Interface (MPI, contd) Topic 8.5 Lecture, Topic 8 Demonstration Video 35: Eureka-style Speculative Task Parallelism 

 

worksheet35lec35lec33-slides

 

 

WS35-solution 
 

13

WedApr 12Lecture 36: Scan Pattern. Parallel Prefix Sum 

 

 
worksheet36lec36-slides  WS36-solutionQuiz for Unit 7 
 FriApr 14Lecture 37: Parallel Prefix Sum applications   worksheet37lec35lec37-slides    
14MonApr 17Lecture 38: Overview of other models and frameworks   lec36lec38-slides    
 WedApr 19Lecture 39: Course Review (Lectures 19-38)   lec37lec39-slides   - 
  Fri Apr 21Lecture 40: Course Review (Lectures 19-38)              lec40-slides  Homework 5   

Lab Schedule

0  Setup  30Futures 27midterm exam ---Apache Spark   Java's ForkJoin Framework

Lab #

Date (20212023)

Topic

Handouts

Examples

1

Jan 09

Infrastructure

setup

lab0-handout

1

Jan 26

Async-Finish Parallel Programming with abstract metrics

lab1-handout

 
- Jan 16No lab this week (MLK)  
2Jan 23Functional Programminglab2-handout 

3

Feb 06

Jan 30

Java Streams

Cutoff Strategy and Real World Performance

lab3-handout
 
-4

 

No lab this week - Spring RecessFeb 06Futureslab4-handout  
4

5

Feb 20

DDFs

13

Data-Driven Tasks

lab5-handoutlab4-handout  
-Feb 20No lab this week (Midterm)  
6

5

Mar 05

Loop-level Parallelism

lab5-handout lab5-intro

-

 

 

  

Feb 27

Async / Finish

lab6-handout 
7Mar 06Recursive Task Cutoff Strategylab7-handout

-

 

Isolated Statement and Atomic Variables

  
- Mar 13No lab this week (Spring Break)Actors  
8 Mar 20Java Threads, Java Locks  lab8-handout 

Message Passing Interface (MPI)

  
9Mar 27Concurrent Listslab9-handout 
10Apr 03Actorslab10-handout 
11

Apr 10

Loop Parallelism

lab11-handout

Eureka-style Speculative Task Parallelism

 

-

 

Apr 17

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.

...