CS 181E Resource Site: Fundamentals of Parallel Programming (Fall 2012)
...
This web site contains resources for the Fall 2012 offering of CS 181E at Harvey Mudd COllegeCollege. For general information on the this course, please go to see the course home Twiki page and the course syllabus.
Lecture Schedule
| Day | Date (2012) | Topic | Slides | Audio (Panopto) | Code ExamplesHomework Assigned | Assignment | ||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Module 1: Deterministic Shared-Memory Parallelism | |||||||||||||||||||||||||||
1 | Wed | Sep 05 | Lecture 1: Introduction, Async-Finish Parallel Programming, Data Races, Computation Graphs |
|
| , Abstract Performance Metrics, Parallel Array Sum | lec1-audio | HW1 HW0 (due by 11:59pm on Tuesday, Sep 11th) | |||||||||||||||||||
2 | Mon | Sep 10 | Lecture 2: Computation Graphs, Abstract Performance Metrics, Parallel Speedup, EfficiencyParallel Array Sum (contd), Amdahl's Law |
|
|
| |||||||||||||||||||||
3 | Wed | Sep 12 | Lecture 3: Array Reductions |
|
|
| HW2 (due by 11:59pm on Sep 18th) | ||||||||||||||||||||
4 | Mon | Sep 17 | School Holiday |
|
|
|
| ||||||||||||||||||||
5 | Wed | Sep 19 | Lecture 4: |
|
| ||||||||||||||||||||||
6 | Mon | Sep 24 | Lecture 5: Data & Control Flow with Async Tasks, Data Races | (See Lab 3) |
| ||||||||||||||||||||||
7 | Wed | Sep 26 | Lecture 6: Memory Models, Atomic Variables | (See Lab 3) |
| ||||||||||||||||||||||
8 | Mon | Oct 01 | Lecture 7: Memory Models (contd), Futures --- Tasks with Return Values |
| |||||||||||||||||||||||
, Weak vs. Strong Scaling, Data Races and Determinism | lec2-audio |
| |||||||||||||||||||||||||
3 | Wed | Sep 12 | Lecture 3: Finish Accumulators, Futures (Tasks with Return Values | 9 | Wed | Oct 03 | Lecture 8: Futures (contd), Dataflow Programming, Data-Driven Tasks |
| |||||||||||||||||||
10 | Mon | Oct 08 | Lecture 9: Abstract vs. Real Performance, seq clause, forasync loops |
| |||||||||||||||||||||||
11 | Wed | Oct 10 | Lecture 10: Forasync Chunking, Parallel Prefix Sum algorithm |
|
| ||||||||||||||||||||||
12 | Mon | Oct 15 | Lecture 11: Parallel Prefix Sum (contd), Parallel Quicksort |
| HW3 (HJ Programming Assignment), SeqScoring.hj, X.txt, Y.txt, BigSeq.zip | ||||||||||||||||||||||
HW1 (due by 11:59pm on Tuesday, Sep 18th) | |||||||||||||||||||||||||||
4 | Mon | Sep 17 | Lecture 4: Parallel Programming Patterns, Seq clause, Forall Loops, Barrier Synchronization | 13 | Wed | Oct 17 | Lecture 12: Finish Accumulators, Forall Loops and Barrier Synchronization | lec12-audio |
|
| |||||||||||||||||
145 | MonWed | Oct 22Sep 19 | Lecture 13: Forall Loops and Barrier Synchronization (contd) | 5: Systolic Algorithms, Parallel Odd-Even Sort | lec13-audio |
|
| 15 | Wed | HW2 (due by 11:59pm on Tuesday, Sep 25th) | |||||||||||||||||
6 | Mon | Sep | Oct 24 | Lecture | 146: | PointCollective and Point-to-point Synchronization | and Phasers
|
| 16 | Mon | Oct 29 | Lecture 15: Phaser Accumulators, Bounded Phasers | lec15 | with Phasers, Phased Forasync Loops, Phaser Accumulators, Loop Chunking | lec6-audio |
| 17 | Wed | Oct 31 | Lecture 16: Summary of Barriers and Phasers |
| ||||||
18 | MonNov 05 | Lecture 17: Task Affinity with Places | 19 | Wed | Nov 07 | Lecture 18: Task Affinity with Places (contd) | lec18-audio | Module 2: Nondeterministic Shared-Memory Parallelism | 20 | Mon | Nov 12 | Lecture 19: Midterm Summary |
| ||||||||||||||
217 | WedNov | 14Sep 26 | Lecture 207: Critical sections and the Isolated statement |
|
| 22 | Mon | Nov 19 | Lecture 21: Isolated statement (contd), Monitors, Actors, Atomic Variables | lec21lec7-audio | |||||||||||||||||
23 | Wed | Nov 21 | Lecture 22: Actors (contd) |
| |||||||||||||||||||||||
24 | Mon | Nov 26 | Lecture 23: Linearizability of Concurrent Objects |
|
| ||||||||||||||||||||||
25 | Wed | Nov 28 | Lecture 24: Linearizability of Concurrent Objects (contd) |
|
| ||||||||||||||||||||||
26 | Mon | Mar 16 | Lecture 25: Safety and Liveness Properties |
|
| ||||||||||||||||||||||
27 | Wed | Mar 19 | Lecture 26: Parallel Programming Patterns |
|
| ||||||||||||||||||||||
28 | Mon | Mar 21 | Lecture 27: Introduction to Java Threads |
| |||||||||||||||||||||||
29 | Wed | Mar 26 | Lecture 28: Bitonic Sort (guest lecture by Prof. John Mellor-Crummey) |
|
|
| |||||||||||||||||||||
HW3 (due by 11:59pm on Thursday, Oct 4th) | |||||||||||||||||||||||||||
8 | Mon | Oct 01 | Lecture 8: Observationally Cooperative Scheduling (Guest lecturer: Prof. Melissa O'Neil) | lec8-slides |
|
|
| ||||||||||||||||||||
9 | Wed | Oct 03 | Lecture 9: Monitors, Actors | lec9-slides | HW4 (due by 11:59pm on Friday, Oct 12th) | ||||||||||||||||||||||
10 | Mon | Oct 08 | Lecture 10: Linearizability of Concurrent Objects, Safety and Liveness Properties, Progress Guarantees | lec10-slides | 30 | Mon | Mar 28 | Lecture 29: Java Threads (contd), Java synchronized statement | lec29-audio |
|
| 31 | Wed | Mar 30 | Lecture 30: Java synchronized statement (contd), advanced locking | ||||||||||||
32 | Mon | Apr 02 | Lecture 31: Java Executors and Synchronizers |
|
| ||||||||||||||||||||||
33 | Wed | Apr 04 | Lecture 32: Volatile Variables and Java Memory Model |
|
| ||||||||||||||||||||||
Module 3: Distributed-Memory Parallelism | 34 | Mon | Apr 06 | Lecture 33: Message Passing Interface (MPI) | |||||||||||||||||||||||
3511 | WedApr | 09Oct 10 | Lecture 34: Message 11: Task Affinity with Places, Message Passing Interface (MPI, contd)lec34 | lec11-slides | lec34lec11-audio |
| |||||||||||||||||||||
36 | Mon | Apr 11 | Lecture 35: Cloud Computing, Map Reduce |
|
| ||||||||||||||||||||||
HW5 (due by 11:59pm on Wednesday, Oct 17th) | |||||||||||||||||||||||||||
12 | Mon | Oct 15 | Lecture 12: Message Passing Interface (contd) | lec12-slides | 37 | Wed | Apr 13 | Lecture 36: Map Reduce (contd) | lec36-audio |
|
| ||||||||||||||||
38 | Mon | Apr 16 | Lecture 37: Speculative parallelization of isolated blocks (Guest lecture by Prof. Swarat Chaudhuri) |
|
|
| |||||||||||||||||||||
39 | Wed | Apr 18 | Lecture 38: Comparison of Parallel Programming Models |
|
| ||||||||||||||||||||||
40 | Mon | Apr 20 | Lecture 39: Course Review |
| Exam 2 (Take-home) |
Lab Schedule
Lab # | Date (2011) | Topic | Handouts | Code Examples | Solutions |
---|---|---|---|---|---|
1 | Jan 10, 11, 12 | DrHJ setup, Async-Finish Parallel Programming | |||
2 | Jan 17, 18, 19 | Abstract performance metrics with async & finish |
| ||
3 | Jan 23, 25, 26 | Data race detection and repair | RacyArraySum1.hj, RacyFib.hj, RacyNQueens.hj, RacyFannkuch.hj |
| |
4 | Jan 30 Feb 01, 02 | Real performance, work-sharing and work-stealing runtimes, futures |
| ||
5 | Feb 07, 08, 09 | Data-driven futures | |||
6 | Feb 14, 15, 16 | Barriers and Phasers | |||
- | Feb 21, 22, 23 | No lab (Exam 1 week) |
|
|
|
7 | Mar 06, 07, 08 | Atomic Variables and Isolated Statement | spanning_tree_atomic.hj, spanning_tree_isolated_object.hj, SortedListExampleObj.hj | ||
8 | Mar 13, 14, 15 | Actors | |||
- | Mar 20, 21, 22 | No lab (HW4 deadline, midterm recess) |
|
|
|
9 | Mar 27, 28, 29 | Java Threads | |||
10 | Apr 03, 04, 05 | Java Locks |
| ||
11 | Apr 10, 11, 12 | Message Passing Interface (MPI) | |||
12 | Apr 17, 18, 19 | Map Reduce |
|
Grading, Honor Code Policy, Processes and Procedures
Grading will be based on your performance on six homeworks (worth 50%), two exams (20% each), and lab attendance (10%).
The purpose of the homeworks is to train you to solve problems and to help deepen your understanding of concepts introduced in class. Homeworks and programming assignments are due on the dates and times specified in the course schedule. Please turn in all your homeworks using the CLEAR turn-in system. Homework is worth full credit when turned in on time. A 10% penalty per day will be levied on late homeworks, up to a maximum of 6 days. No submissions will be accepted more than 6 days after the due date.
You will be expected to follow the Honor Code in all homeworks and exams. All submitted homeworks are 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 ([as shown here|http://www.dartmouth.edu/~writing/sources/]). Exams 1 and 2, which are pledged under the Honor Code, test your individual understanding and knowledge of the material. Collaboration on exams is strictly forbidden. Finally, it is also your responsibility to protect your homeworks and exams from unauthorized access.
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 week.
Past Offerings of COMP 322
Accommodations for Students with Special Needs
...
13 | Wed | Oct 17 | Lecture 13: Course Review | lec13-slides |
|
| Take-home Final Exam (3-hour duration, due by 5pm on Oct 19th) |
---|