Versions Compared

Key

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


Home

Office Hours

HJlib Info

edX site

Autograder Guide

Other Resources

COMP 322: Fundamentals of Parallel Programming (Spring

...

2023)

 


Instructors

Instructor:

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

spring2023/comp322 (Piazza is the preferred medium for all course communications)

Cross-listing:

ELEC 323

Lecture location:

Herzstein Amphitheater

(online 1st 2 weeks)

Lecture times:

MWF 1:00pm - 1:50pm

Lab locations:

Mon (Herzstein Amp), Tue (Keck 100

(online 1st 2 weeks

)

Lab times:

Mon  3:00pm - 3:50pm (Raiyan, Oscar, Mohamed, Ryan, Michelle, Taha)

Wed

Tue 4:

30pm

00pm -

5

4:

20pm (

50pm (Tina, Delaney, Chase, Hung, Jerry, Kailin, Jasmine)

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.

...

There are no required textbooks for the class. Instead, lecture handouts are provided for each module as follows.  You are expected to read the relevant sections in each lecture handout before coming to the lecture.  We will also provide a number of references in the slides and handouts.The links to the latest versions of the lecture handouts are included below:

  • Module 1 handout (Parallelism)
  • Module 2 handout  handout (Concurrency)

There

...

There are also a few 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:

 

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

...

Lecture Schedule

 

 



Week

Week

Day

Date (

2022 

2023)

Lecture

Assigned Reading

Assigned Videos (see Canvas site for video links)

In-class Worksheets

Slides

Work Assigned

Work Due

 
Worksheet Solutions

1

Mon

Jan

10Topic 1.1 Lecture, Topic 1.1 Demonstration

09

Lecture 1:

Task Creation and Termination (Async, Finish)Module 1: Section 1.1

Introduction



worksheet1lec1-
slides

 

 

  
slides  



WS1-solution
 


Wed

Jan

12

11

Lecture 2: 

Computation Graphs, Ideal ParallelismModule 1: Sections 1.2, 1.3Topic 1.2 Lecture, Topic 1.2 Demonstration, Topic 1.3 Lecture, Topic 1.3 Demonstration

Functional Programming



worksheet2
lec2 
lec02-slides

Homework 1

 

  



WS2-solution

FriJan
14
13Lecture 3:
Abstract Performance Metrics, Multiprocessor SchedulingModule 1: Section 1.4Topic 1.4 Lecture, Topic 1.4 Demonstration
Higher order functions

worksheet3 
worksheet3
lec3-
slides

 

   

2

Mon

Jan 17

Lecture 4: Parallel Speedup and Amdahl's Law

Module 1: Section 1.5Topic 1.5 Lecture, Topic 1.5 Demonstrationworksheet4lec4-slidesQuiz for Unit 1   

 

Wed

Jan 19

Lecture 5: Future Tasks, Functional Parallelism ("Back to the Future")
slides   



WS3-solution

2

Mon

Jan 16

No class: MLK










Wed

Jan 18

Lecture 4: Lazy Computation



worksheet4lec4-slides

WS4-solution


Fri

Jan 20

Lecture 5: Java Streams



worksheet5lec5-slidesHomework 1
WS5-solution
3MonJan 23

Lecture 6: Map Reduce with Java Streams

Module 1: Section 2.
1
4Topic 2.
1
4 Lecture, Topic 2.
1
4 Demonstration  
worksheet5
worksheet6
lec5
lec6-slides
    

 

Fri

Jan 21



WS6-solution


Wed

Jan 25

Lecture 7: Futures

Lecture 6:   Finish Accumulators

Module 1: Section 2.
3
1Topic 2.
3
1 Lecture , Topic 2.
3
1 Demonstration
worksheet6
worksheet7
lec6
lec7-slides
 Quiz for Unit 1  3Mon



WS7-solution


Fri

Jan 27

Lecture 8:  Async, Finish, Computation Graphs

Jan 24Lecture 7: Map Reduce

Module 1:
Section 2.4
Sections 1.1, 1.2Topic
2
1.
4 Lecture
1 Lecture, Topic 1.1 Demonstration, Topic 1.2 Lecture, Topic 1.
4
2 Demonstration
  
worksheet7
worksheet8
lec7
lec8-slides
 


WS8-solution
 

4

 
Mon

 Lecture 8: Data Races, Functional & Structural Determinism


Jan 30 

Wed

Jan 26

Lecture 9: Ideal Parallelism, Data-Driven Tasks 

Module 1: Section

2

1.

5

3,

2

4.

6

5


Topic

2

1.

5

3 Lecture, Topic

2

1.

5

3 Demonstration, Topic

2

4.

6

5 Lecture, Topic

2

4.

6

5 Demonstration

   

worksheet8

worksheet9

lec8
lec9-
slides

Homework 2

Homework 1  

 

Fri

Jan 28

Lecture 9: Java’s Fork/Join Library

 Topic 2.7 Lecture, Topic 2.7 Demonstration, Topic 2.8 Lecture, Topic 2.8 Demonstrationworksheet9lec9-slidesQuiz for Unit 2   

4

Mon

 

Jan 31          WedFeb 02          FriFeb 04         5

Mon

Feb 07

Lecture 10: Loop-Level Parallelism, Parallel Matrix MultiplicationModule 1: Sections 3.1, 3.2Topic 3.1 Lecture , Topic 3.1 Demonstration ,  Topic 3.2 Lecture,  Topic 3.2 Demonstrationworksheet10lec10-slides    

 

Wed

Feb 09

Lecture 11: Iteration Grouping (Chunking), Barrier Synchronization

Module 1: Sections 3.3, 3.4

Topic 3.3 Lecture , Topic 3.3 Demonstration, Topic 3.4 Lecture  ,   Topic 3.4 Demonstration

worksheet11lec11-slides    

 

Fri

Feb 11

 Lecture 12: Data-Driven Tasks 

 

Module 1: Sections 4.5

Topic 4.5 Lecture   Topic 4.5 Demonstration

worksheet12lec12-slides Quiz for Unit 2  6

Mon

Feb 14

 

        

 

Wed

Feb 16

Lecture 13: Parallelism in Java Streams, Parallel Prefix Sums 

Module 1: Sections 3.7Topic 3.7 Lecture , Topic 3.7 Demonstrationworksheet13lec13-slides

Homework 3 (includes one intermediate checkpoint)

 

Homework 2   FriFeb 18

Lecture 14: 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 Demonstrationworksheet14 lec14-slidesQuiz for Unit 3   

7

Mon

Feb 21

Lecture 17: Midterm Review

   lec17-slides    

 

Wed

Feb 23

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

   lec18-slides    

 

Fri

Feb 25 

Lecture 19: Data Races, Functional & Structural Determinism

Module 1: Sections 2.5, 2.6Topic 2.5 Lecture, Topic 2.5 Demonstration, Topic 2.6 Lecture, Topic 2.6 Demonstrationworksheet19lec19-slides    

8

Mon

Feb 28

Lecture 20
slides 

WS9-solution

WedFeb 01Lecture 10: Event-based programming model




worksheet10lec10-slides
Homework 1WS10-solution

FriFeb 03Lecture 11: GUI programming, Scheduling/executing computation graphs

Module 1: Section 1.4Topic 1.4 Lecture , Topic 1.4 Demonstrationworksheet11lec11-slidesHomework 2
WS11-solution
5

Mon

Feb 06

Lecture 12: Abstract performance metrics, Parallel Speedup, Amdahl's Law Module 1: Section 1.5Topic 1.5 Lecture , Topic 1.5 Demonstrationworksheet12lec12-slides

WS12-solution


Wed

Feb 08

Lecture 13: Accumulation and reduction. Finish accumulators

Module 1: Section 2.3

Topic 2.3 Lecture   Topic 2.3 Demonstration

worksheet13lec13-slides 
WS13-solution


Fri

Feb 10

No class: Spring Recess










6

Mon

Feb 13

Lecture 14: Data Races, Functional & Structural Determinism

Module 1: Sections 2.5, 2.6Topic 2.5 Lecture ,  Topic 2.5 Demonstration,  Topic 2.6 Lecture,  Topic 2.6 Demonstrationworksheet14lec14-slides

WS14-solution


Wed

Feb 15

Lecture 15: Limitations of Functional parallelism.
Abstract vs. real performance. Cutoff Strategy



worksheet15lec15-slides



Homework 2WS15-solution

FriFeb 17

Lecture 16: Recursive Task Parallelism  



worksheet16 lec16-slidesHomework 3
WS16-solution

7

Mon

Feb 20

Lecture 17: Midterm Review




lec17-slides




Wed

Feb 22

Lecture 18: Midterm Review




lec18-slides




Fri

Feb 24 

Lecture 19: 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 Demonstrationworksheet19lec19-slides

WS19-solution

8

Mon

Feb 27

Lecture 20: Barrier Synchronization with Phasers

Module 1: Sections 3.4 Topic 3.4 Lecture, Topic 3.4 Demonstrationworksheet20lec20-slides      

WS20-solution


Wed

Mar 01

Lecture 21:Stencil computation. Point-to-point Synchronization with Phasers

Module 1: Sections 4.2, 4.3

Topic 4.2 Lecture, Topic 4.2 Demonstration, Topic 4.3 Lecture, Topic 4.3 Demonstrationworksheet21lec21-slides

WS21-solution


Fri

Mar 03

Lecture 22: Fuzzy Barriers with Phasers

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


WS22-solution

9

Mon

Mar 06

Lecture 23:  Fork/Join programming model. OS Threads. Scheduler Pattern


Topic 2.7 Lecture, Topic 2.7 Demonstration, Topic 2.8 Lecture, Topic 2.8 Demonstration

worksheet23 lec23-slides

Homework 3 (CP 1)

WS23-solution


Wed

Mar 08

Lecture 24: 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 Demonstration
worksheet20
worksheet24
lec20
lec24-slides
   Quiz for Unit 4Quiz for Unit 3  

 

Wed

Mar 02

Lecture 21: N-Body problem, applications and implementations

  worksheet21lec21-slides    

 

Fri

Mar 04

Lecture 22: Fork/Join programming model. OS Threads. Scheduler Pattern

Module 2: Sections 7.1, 7.2Topic 7.1 Lecture


WS24-solution


Fri

Mar 10

 Lecture 25:  Atomic variables, Synchronized statementsModule 2: Sections 5.4, 7.2Topic 5.4 Lecture, Topic 5.4 Demonstration, Topic 7.2
Lecture
Lecture 
worksheet22
worksheet25
lec22-slides 

Quiz for Unit 4

  

9

Mon

Mar 07

Lecture 23: Locks, Atomic variables

Module 2: 7.3

Topic 7.3 Lecture

worksheet23 lec23-slides Quiz for Unit 5

 

  

 

Wed

Mar 09

Lecture 24: Parallel Spanning Tree, other graph algorithms

  worksheet24 lec24-slides 

Homework 3, Checkpoint-1

  

 

Fri

Mar 11

 Lecture 25: Linearizability of Concurrent ObjectsModule 2: 7.4Topic 7.4 Lectureworksheet25lec25-slidesQuiz for Unit 6

Quiz for Unit 5

   

Mon

Mar 14

Spring Break

     

 

   WedMar 16Spring Break    

 

   

 

Fri

Mar 18

Spring Break

     

 

  

10

Mon

Mar 21

Lecture 26: Java Locks - Soundness and progress guarantees

Module 2: 7.5Topic 7.5 Lecture worksheet26lec26-slides Homework 4 (includes one intermediate checkpoint)Homework 3 (all)  

 

Wed

Mar 23

Lecture 27: Dining Philosophers Problem

Module 2: 7.6Topic 7.4 Lecture Topic 7.6 Lectureworksheet27lec27-slides

 

   

 

Fri

Mar 25

Lecture 28: Read-Write Pattern. Read-Write Locks. Fairness & starvation

Module 2: 7.3, 7.5Topic 7.3 Lecture, Topic 7.5 Lecture, worksheet28lec28-slides

Quiz for Unit 7

 

 

  

11

Mon

Mar 28

Lecture 29: Task Affinity and locality. Memory hierarchy

  worksheet29lec29-slides

 

Quiz for Unit 6

  

 

Wed

Mar 30

Lecture 30: Reactor Pattern. Web servers

  worksheet30lec30-slides

 

   

 

Fri

Apr 01

Lecture 31: Scan Pattern. Parallel Prefix Sum, uses and algorithms

  worksheet31lec31-slidesQuiz for Unit 8

Quiz for Unit 7

  

12

Mon

Apr 04

Lecture 32: Data-Parallel Programming model. Loop-Level Parallelism, Loop ChunkingModule 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 Demonstrationworksheet32lec32-slides

 

Homework 4 Checkpoint-1

  

 

Wed

Apr 06

Lecture 33: Barrier Synchronization with phasers

Module 1: Section 3.4

Topic 3.4 Lecture ,   Topic 3.4 Demonstration

worksheet33lec33-slides

 

   

 

Fri

Apr 08

Lecture 34:  Stencil computation. Point-to-point Synchronization with Phasers

Module 1: Section 4.2, 4.3Topic 4.2 Lecture ,   Topic 4.2 Demonstration, Topic 4.3 Lecture,  Topic 4.3 Demonstrationworksheet34lec34-slides 

Quiz for Unit 8

  

13

Mon

Apr 11

Lecture 35: Message-Passing programming model with ActorsModule 2: 6.1, 6.2

Topic 6.1 Lecture ,   Topic 6.1 Demonstration ,   Topic 6.2 Lecture, Topic 6.2 Demonstration

worksheet35lec35-slides

 

 

   WedApr 13Lecture 36: Active Object Pattern. Combining Actors with task parallelismModule 2: 6.3, 6.4

Topic 6.3 Lecture ,   Topic 6.3 Demonstration ,   Topic 6.4 Lecture, Topic 6.4 Demonstration

worksheet36lec36-slides Homework 4 (all)   FriApr 15Lecture 37: Eureka-style Speculative Task Parallelism  worksheet37lec37-slides    14MonApr 18Lecture 38: Overview of other models and frameworks   lec38-slides     WedApr 20Lecture 39: Course Review (Lectures 19-38)   lec39-slides     FriApr 22Lecture 40: Course Review (Lectures 19-38)   lec40-slides    

Lab Schedule

lec25-slides


WS25-solution

Mon

Mar 13

No class: Spring Break


 






WedMar 15No class: Spring Break








Fri

Mar 17

No class: Spring Break









10

Mon

Mar 20

Lecture 26: Parallel Spanning Tree, other graph algorithms



worksheet26lec26-slides

WS26-solution


Wed

Mar 22

Lecture 27: Java Threads and Locks

Module 2: Sections 7.1, 7.3Topic 7.1 Lecture, Topic 7.3 Lectureworksheet27lec27-slides


Homework 3 (CP 2)WS27-solution


Fri

Mar 24

Lecture 28: Java Locks - Soundness and progress guarantees

Module 2: Section 7.5Topic 7.5 Lectureworksheet28lec28-slides




WS28-solution

11

Mon

Mar 27

Lecture 29:  Dining Philosophers Problem

Module 2: Section 7.6Topic 7.6 Lectureworksheet29lec29-slides



WS29-solution


Wed

Mar 29

Lecture 30: Read-Write Locks, Linearizability of Concurrent Objects

Module 2: Sections 7.3, 7.4Topic 7.3 Lecture, Topic 7.4 Lectureworksheet30lec30-slides



WS30-solution


Fri

Mar 31

Lecture 31: Message-Passing programming model with Actors

Module 2: Sections 6.1, 6.2Topic 6.1 Lecture, Topic 6.1 Demonstration,   Topic 6.2 Lecture, Topic 6.2 Demonstrationworksheet31lec31-slides


WS31-solution

12

Mon

Apr 03

No class



Homework 4

Homework 3 (All)




Wed

Apr 05

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

Module 2: Sections 6.3, 6.4

Topic 6.3 Lecture, Topic 6.3 Demonstration,   Topic 6.4 Lecture, Topic 6.4 Demonstration

worksheet32lec32-slides



WS32-solution


Fri

Apr 07

Lecture 33: Task Affinity and locality. Memory hierarchy

 
worksheet33lec33-slides


WS33-solution

13

Mon

Apr 10

Lecture 34: Eureka-style Speculative Task Parallelism


worksheet34lec34-slides



WS34-solution

WedApr 12Lecture 35: Scan Pattern. Parallel Prefix Sum


worksheet35lec35-slides
Homework 4 (CP 1)WS35-solution

FriApr 14Lecture 36: Parallel Prefix Sum applications

worksheet36lec36-slides

WS36-solution
14MonApr 17Lecture 37: Overview of other models and frameworks


lec37-slides




WedApr 19Lecture 38: Course Review (Lectures 19-34)
 
lec38-slides
Homework 4 (All)


FriApr 21Lecture 39: Course Review (Lectures 19-34)


lec39-slides




Lab Schedule

Lab #

Date (2023)

Topic

Handouts

Examples

1

Jan 09

Infrastructure setup

lab0-handout

lab1-handout


-Jan 16No lab this week (MLK)

2Jan 23Functional Programminglab2-handout

3

Jan 30

Futures

lab3-handout

4Feb 06Data-Driven Taskslab4-handout

5

Feb 13

Async / Finish

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

6

Feb 27

Loop Parallelism 

lab6-handoutimage kernels
7Mar 06Recursive Task Cutoff Strategylab7-handout
-Mar 13No lab this week (Spring Break)

-Mar 20No lab this week

8Mar 27Java Threadslab8-handout
9Apr 03Concurrent Listslab9-handout
10

Apr 10

Actors

lab10-handout

-

Apr 17

No lab this week

Lab #

Date (2021)

Topic

Handouts

Examples

0 Infrastructure Setuplab0-handout 

1

Jan 10

Async-Finish Parallel Programming with abstract metrics

lab1-handout
 -Jan 17   

2

Jan 24

Futures

lab2-handout
 -Jan 31   

3

Feb 07

Cutoff Strategy and Real World Performance

lab3-handout  4

Feb 14

DDFs

lab4-handout  -

Feb 21

No lab this week (Midterm exam)

  -Feb 28   5Mar 07Loop-level Parallelismlab5-handoutlab5-intro

6

Mar 14

Isolated Statement and Atomic Variables

lab6-handout -Mar 21   7Mar 28Java Threads, Java Lockslab7-handout 8

Apr 04

Actors

lab8-handout 

-

Apr 11

Message Passing Interface (MPI)

  

-

Apr 18

Apache Spark

  

-

 

Eureka-style Speculative Task Parallelism

  - 

Java's ForkJoin Framework

  



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.

...