You are viewing an old version of this page. View the current version.

Compare with Current View Page History

« Previous Version 14 Next »

CS 181E Resource Site: Fundamentals of Parallel Programming (Fall 2012)

Introduction

This web site contains resources for the Fall 2012 offering of CS 181E at Harvey Mudd College.  For general information on this course, please go to the course home page.

 

Lecture Schedule

 

Day

Date (2012)

Topic

Slides

Audio (Panopto)

Code Examples

Assignment

   Module 1: Deterministic Shared-Memory Parallelism    

1

Wed

Sep 05

Lecture 1: Introduction, Async-Finish Parallel Programming, Computation Graphs, Abstract Performance Metrics, Amdahl's Law

 

 

 

HW1 (due by 11:59pm on Sep 11th)

2

Mon

Sep 10

Lecture 2: Data Races and Determinism, Finish Accumulators, Futures (Tasks with Return Values), Dataflow Programming, Data-Driven Tasks

 

 

 

 

3

Wed

Sep 12

Lecture 3: Abstract vs. Real Performance, Seq clause, Forasync Loops, Loop Chunking, Forall Loops and Barrier Synchronization

 

 

 

HW2 (due by 11:59pm on Sep 18th)

4

Mon

Sep 17

Lecture 4: Parallel Prefix Sum algorithm, Parallel QuickSort, Point-to-point Synchronization, Phasers

 

 

 

 

5

Wed

Sep 19

Lecture 5: Parallel MergeSort, Parallel BitonicSor

 

 

 

HW3 (due by 11:59pm on Sep 25th)

6

Mon

Sep 24

Lecture 6: Phaser Accumulators, Bounded Phasers, Memory Consistency Models, Summary of Deterministic Shared-Memory Parallelism

 

  

 

   Module 2: Nondeterministic Shared-Memory Parallelism    

7

Wed

Sep 26

Lecture 7: Actors

 

 

 

HW4 (due by 11:59pm on Oct 2nd)

8

Mon

Oct 01

Lecture 8: Systolic arrays, Systolic algorithms (*Module 3 topic)

 

 

 

 

9

Wed

Oct 03

Lecture 9: Critical sections and the Isolated statement, Monitors, Atomic Variables, Linearizability of Concurrent Objects

 

 

 

HW5 (due by 11:59pm on Oct 9th)

10

Mon

Oct 08

Lecture 10: Linearizability of Concurrent Objects (contd), Safety and Liveness Properties

 

 

 

 

   Module 3: Distributed-Memory Parallelism    

11

Wed

Oct 10

Lecture 11: Task Affinity with Places, Message Passing Interface (MPI), demonstration of LittleFe cluster system

 

 

 

HW6 (due by 11:59pm on Oct 16h)

12

Mon

Oct 15

Lecture 12: Cloud Computing, MapReduce, GPU Programming

 

 

 

 

   Module 4: Real-world Parallel Programming Models and Challenges    

13

Wed

Oct 17

Lecture 13: Real-World Parallel Programming Models, Course Review

 

 

 

Take-home Final Exam (3-hour duration, due by 5pm on Oct 19th)

  • No labels