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

...

2024)


Instructor:

Prof. Vivek Sarkar

Mackale Joyner, DH

3131

2063

Head TA:Max Grossman

Admin Assistant:

Annepha Hurlock, annepha@rice.edu, DH 3080, 713-348-5186

Graduate TAs:

Jonathan Sharman, Ryan Spring, Bing Xue, Lechen Yu

Co-Instructor:Dr. Mackale JoynerUndergraduate TAs:

Marc Canby, Anna Chi, Peter Elmers, Joseph Hungate, Cary Jiang, Gloria Kim, Kevin Mullin, Victoria Nazari, Ashok Sankaran, Sujay Tadwalkar, Anant Tibrewal, Eugene Wang, Yufeng Zhou

Piazza site:

https://piazza.com/class/ixdqx0x3bjl6en (Piazza is the preferred medium for all course communications, but you can also send email to comp322-staff at rice dot edu if needed)

Cross-listing:

ELEC 323

Lecture location:

Herzstein Hall 210

Lecture times:

MWF 1:00pm - 1:50pm (followed by group office hours during 2pm - 3pm, usually in DH 3092)

Lab locations:

DH 1064, DH 1070

Lab times:

Wednesday, 07:00pm - 08:30pm

Course Syllabus

TAs:Alison Qiu, Haotian Dang, Andrew Ondara, Stefan Boskovic, Huzaifa Ali, Raahim Absar

Piazza site:

https://piazza.com/rice/spring2024/comp322 (Piazza is the preferred medium for all course communications)

Cross-listing:

ELEC 323

Lecture location:

TBD

Lecture times:

MWF 1:00pm - 1:50pm

Lab locations:

Mon (TBD)

Tue (TBD)

Lab times:

Mon  3:00pm - 3:50pm

Tue   4:00pm - 4:50pm 

Course Syllabus

A summary PDF file 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 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.

...

The prerequisite course requirements are COMP 182 and COMP 215.  COMP 322 should be accessible to anyone familiar with the foundations of sequential algorithms and data structures, and with basic Java programming.  COMP 321 is also recommended as a co-requisite.  

Textbooks and Other Resources

There are no required textbooks for the class. Instead, lecture handouts are provided for each module as follows.  The .  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 on Canvas are of the lecture handouts are included below:

  • Module 1 handout (Parallelism)
  • Module 2 handout (Concurrency)Module 3 handout (Distribution and Locality)

...

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

Past Offerings of COMP 322

Lecture Schedule



Week

Day

Date (2024)

Lecture

Assigned Reading

Assigned Videos (see Canvas site for video links)

In-class Worksheets

Slides

Work Assigned

Work Due

Worksheet Solutions

1

Mon

Jan 08

Lecture 1: Introduction



worksheet1lec1-slides  



WS1-solution


Wed

Jan 10

Lecture 2:  Functional Programming



worksheet2lec02-slides



WS2-solution

FriJan 12Lecture 3: Higher order functions

worksheet3 lec3-slides   



WS3-solution

2

Mon

Jan 15

No class: MLK










Wed

Jan 17

Lecture 4: Lazy Computation



worksheet4lec4-slides

WS4-solution


Fri

Jan 19

Lecture 5: Java Streams



worksheet5lec5-slidesHomework 1
WS5-solution
3MonJan 22

Lecture 6: Map Reduce with Java Streams

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



WS6-solution


Wed

Jan 24

Lecture 7: Futures

Module 1: Section 2.1Topic 2.1 Lecture , Topic 2.1 Demonstrationworksheet7lec7-slides



WS7-solution


Fri

Jan 26

Lecture 8:  Async, Finish, Computation Graphs

Module 1: Sections 1.1, 1.2Topic 1.1 Lecture, Topic 1.1 Demonstration, Topic 1.2 Lecture, Topic 1.2 Demonstrationworksheet8lec8-slides

WS8-solution

4

Mon


Jan 29 Lecture 9: Ideal Parallelism, Data-Driven Tasks 

Module 1: Section 1.3, 4.5


Topic 1.3 Lecture, Topic 1.3 Demonstration, Topic 4.5 Lecture, Topic 4.5 Demonstration

worksheet9

lec9-slides 

WS9-solution

WedJan 31Lecture 10: Event-based programming model




worksheet10lec10-slides
Homework 1WS10-solution

FriFeb 02Lecture 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 05

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 07

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 09

No class: Spring Recess










6

Mon

Feb 12

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 14

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



worksheet15lec15-slides



Homework 2WS15-solution

FriFeb 16

Lecture 16: Recursive Task Parallelism  



worksheet16 lec16-slidesHomework 3
WS16-solution

7

Mon

Feb 19

Lecture 17: Midterm Review




lec17-slides




Wed

Feb 21

Lecture 18: Midterm Review




lec18-slides




Fri

Feb 23 

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 26

Lecture 20: Barrier Synchronization with Phasers

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

WS20-solution


Wed

Feb 28

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 01

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 04

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 06

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

Module 2: Sections 5.1, 5.2Topic 5.1 Lecture, Topic 5.1 Demonstration, Topic 5.2 Lecture, Topic 5.2 Demonstration, Topic 5.6 Lecture, Topic 5.6 Demonstrationworksheet24 lec24-slides


WS24-solution


Fri

Mar 08

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


WS25-solution

Mon

Mar 11

No class: Spring Break


 






WedMar 13No class: Spring Break








Fri

Mar 15

No class: Spring Break









10

Mon

Mar 18

Lecture 26: Parallel Spanning Tree, other graph algorithms



worksheet26lec26-slides

WS26-solution


Wed

Mar 20

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 22

Lecture 28: Java Locks - Soundness and progress guarantees

Module 2: Section 7.5Topic 7.5 Lectureworksheet28lec28-slides




WS28-solution

11

Mon

Mar 25

Lecture 29:  Dining Philosophers Problem

Module 2: Section 7.6Topic 7.6 Lectureworksheet29lec29-slides



WS29-solution


Wed

Mar 27

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 29

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 01

Lecture 32: Active Object Pattern. Combining Actors with task parallelismModule 2: Sections 6.3, 6.4Topic 6.3 Lecture, Topic 6.3 Demonstration,   Topic 6.4 Lecture, Topic 6.4 Demonstrationworksheet32lec32-slides

Homework 4

Homework 3 (All)

WS32-solution


Wed

Apr 03

Lecture 33: Task Affinity and locality. Memory hierarchy



worksheet33lec33-slides



WS33-solution


Fri

Apr 05

Lecture 34: Eureka-style Speculative Task Parallelism

 
worksheet34lec34-slides


WS34-solution

13

Mon

Apr 08

No class: Solar Eclipse









WedApr 10Lecture 35: Scan Pattern. Parallel Prefix Sum


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

FriApr 12Lecture 36: Parallel Prefix Sum applications

worksheet36lec36-slides

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


lec37-slides




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


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


lec39-slides




Lab Schedule

Lab #

Date (2023)

Topic

Handouts

Examples

1

Jan 08

Infrastructure setup

lab0-handout

lab1-handout


-Jan 15No lab this week (MLK)

2Jan 22Functional Programminglab2-handout

3

Jan 29

Futures

lab3-handout

4Feb 05Data-Driven Taskslab4-handout

5

Feb 12

Async / Finish

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

6

Feb 26

Loop Parallelism 

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

-Mar 18Java Threadslab8-handout
8Mar 25Concurrent Listslab9-handout
9Apr 01Actorslab10-handout
10

Apr 08

No lab this week (Solar Eclipse)



-

Apr 15

No lab this week

Lecture Schedule

 

...

Week

...

Day

...

Date (2017)

...

Lecture

...

Assigned Videos (see Canvas site for vide links)

...

In-class Worksheets

...

Work Assigned

...

Work Due

...

1

...

Mon

...

Jan 09

...

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

...

 

...

 

...

 

...

Wed

...

Jan 11

...

Lecture 2:  Computation Graphs, Ideal Parallelism

...

Homework 1

...

 

...

 

...

2

...

Mon

...

Jan 16

...

No lecture, School Holiday (Martin Luther King, Jr. Day)

...

 

...

Wed

...

Jan 18

...

Lecture 4:   Parallel Speedup and Amdahl's Law

...

 

...

Fri

...

Jan 20

...

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

...

3

...

Mon

...

Jan 23

...

Lecture 6: Memoization

...

Lecture 7: Finish Accumulators

...

Homework 2

...

 

...

Fri

...

Jan 27

...

Lecture 8: Map Reduce

...

 

...

4

...

Mon

...

Jan 30

...

Lecture 9: Data Races, Functional & Structural Determinism

...

 

...

Wed

...

Feb 01

...

 

...

Fri

...

Feb 03

...

Lecture 11: Loop-Level Parallelism, Parallel Matrix Multiplication, Iteration Grouping (Chunking)

...

Topic 3.1 Lecture , Topic 3.1 Demonstration , Topic 3.2 Lecture, Topic 3.2 Demonstration, Topic 3.3 Lecture , Topic 3.3 Demonstration

...

5

...

Mon

...

Feb 06

...

Lecture 12:  Barrier Synchronization

...

Wed

...

Feb 08

...

Lecture 13: Parallelism in Java Streams, Parallel Prefix Sums

...

 

 Homework 3 (includes two intermediate checkpoints) 

 

...

-

...

Fri

...

Feb 10

...

Spring Recess

...

6

...

Mon

...

Feb 13

...

Lecture 14: Iterative Averaging Revisited, SPMD pattern

...

 

...

Wed

...

Feb 15

...

Lecture 15:  Phasers, Point-to-point Synchronization

...

 

...

Fri

...

Feb 17

...

Lecture 16: Phasers Review

...

7

...

Mon

...

Feb 20

...

Lecture 17: Midterm Summary

...

 

...

Wed

...

Feb 22

...

Midterm Review (interactive Q&A, no lecture)

...

 

...

Fri

...

Feb 24

...

Lecture 18: Abstract vs. Real Performance

...

8

...

Mon

...

Feb 27

...

Lecture 19: Pipeline Parallelism, Signal Statement, Fuzzy Barriers

...

 

...

 

...

Wed

...

Mar 01

...

Lecture 20: Critical sections, Isolated construct, Parallel Spanning Tree algorithm (start of Module 2)

...

 

...

 

...

Fri

...

Mar 03

...

Lecture 21:  Atomic variables, Read-Write Isolation

...

Quiz for Unit 4

...

9

...

Mon

...

Mar 06

...

Lecture 23: Java Threads, Java synchronized statement

...

 

...

 

 

...

 

...

Wed

...

Mar 08

...

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

...

 

...

Homework 3, Checkpoint-2

...

 

...

Fri

...

Mar 10

...

Lecture 24: TBD

...

M-F

...

Mar 13 - Mar 17

...

Spring Break

...

10

...

Mon

...

Mar 20

...

Lecture 25: Concurrent Objects, Linearizability of Concurrent Objects

...

 

 

...

 

...

Wed

...

Mar 22

...

Lecture 26: Linearizability (contd), Java locks

...

Homework 4

(includes one intermediate checkpoint)

...

 

...

Fri

...

Mar 24

...

Lecture 27: Parallel Design Patterns, Safety and Liveness Properties  

...

 

...

11

...

Mon

...

Mar 27

...

Lecture 28: Actors

...

lec28-slides

...

 

...

Wed

...

Mar 29

...

Lecture 29:  Actors (contd)

...

 

...

 

...

Fri

...

Mar 31

...

Lecture 30: Java Synchronizers, Dining Philosophers Problem

...

12

...

Mon

...

Apr 03

...

Lecture 31: Eureka-style Speculative Task Parallelism

...

 

...

 

...

Wed

...

Apr 05

...

Lecture 32:  Task Affinity with Places (start of Module 3)

...

 

...

Homework 4 Checkpoint-1

...

 

...

Fri

...

Apr 07

...

Lecture 33: Message Passing Interface (MPI)

...

 

...

 

...

13

...

Mon

...

Apr 10

...

Lecture 34: Message Passing Interface (MPI, contd)

...

 

...

Wed

...

Apr 12

...

Lecture 35: GPU Computing

...

Homework 5  

(Due April 21st, with automatic extension until May 1st after which slip days may be used)

...

Homework 4 (all)

...

 

...

Fri

...

Apr 14

...

Lecture 36: Partitioned Global Address Space (PGAS) programming models

...

lec36-slides

...

14

...

Mon

...

Apr 17

...

Lecture 37: Apache Spark framework

...

 

...

 

...

Wed

...

Apr 19

...

 

...

 

...

 

...

 

...

Fri

...

Apr 21

...

Lecture 39: Course Review (lectures 20-37), Last day of classes

...

Homework 5 (automatic extension until May 1st, after which slip days may be used)

...

-

...

 

...

April 26 - May 3

...

Scheduled final exam (Exam 2 – scope of exam limited to lectures 18-37), location and time TBD by registrar

...

 

...

 

...

 

Lab Schedule

Lab #

Date (2017)

Topic

Handouts

Code Examples

0 Infrastructure Setuplab0-handout-

1

Jan 11

Async-Finish Parallel Programming with abstract metrics

lab1-handout, lab1-slides
lab_1.zip

2

Jan 18

Futures and HJ-Viz 

lab2-handout, lab2-slides
lab_2.zip

3

Jan 25

Cutoff Strategy and Real World Performance

lab3-handout, lab3-slides lab_3.zip

4

Feb 01

Java's ForkJoin Framework

lab4-handout, lab4-slides   lab_4.zip

5

Feb 08

Loop-level Parallelism

lab5-handout, lab5-slides lab_5.zip

6

Feb 15

Phasers

lab6-handout   lab_6.zip

-

Feb 22

No lab this week — Exam 1

--

7

Mar 01

Isolated Statement and Atomic Variables

lab7-handout 

8

Mar 08

Java Threads

lab8-handout  

-

Mar 15

No lab this week — Spring Break

  9

Mar 22

Java Locks

lab9-handout  

10

Mar 29

Actors and Selectors

lab10-handout  

11

Apr 05

Eureka-style Speculative Task Parallelism

lab11-handout  

12

Apr 12

Message Passing Interface (MPI)

lab12-handout 13Apr 19Apache Spark
lab13-handout 



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 class participation including in-class Q&A, worksheets, Piazza participation 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.

Labs must be submitted by the following Monday at 3pm.  Labs must be checked off by a TA prior to the start of the lab the following week..

Worksheets should be completed by the deadline listed in Canvas 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, 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.

 Graded homeworks will be returned to you via email, and exams as marked-up hardcopies. If you believe we have made an error in grading your homework or exam, please bring the matter to our

attention within one weekFor grade disputes, please send an email to the course instructors within 7 days of receiving your grade. The email subject should include COMP 322 and the assignment. Please provide enough information in the email so that the instructor does not need to perform a checkout of your code.

Accommodations for Students with Special Needs

...