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 |
|---|---|---|---|---|---|---|---|
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 |
|
|
|
|
5 | Wed | Sep 19 | Lecture 5: Parallel MergeSort, Parallel BitonicSort |
| HW3 (due by 11:59pm on Sep 25th) | ||
6 | Mon | Sep 24 | Lecture 6: Point-to-point Synchronization and Phasers, Phaser Accumulators, Bounded Phasers, Summary of Deterministic 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 |
|
| ||
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 |
|
| ||
11 | Wed | Oct 10 | Lecture 11: Task Affinity with Places, Message Passing Interface (MPI) |
| HW6 (due by 11:59pm on Oct 16h) | ||
12 | Mon | Oct 15 | Lecture 12: Memory Models, |
|
| ||
13 | Wed | Oct 17 | Lecture 12: |
| Take-home Final Exam (3-hour duration, due by 5pm on Oct 19th) | ||
14 | Mon | Oct 22 | Lecture 13: |
|
| ||
15 | Wed | Oct 24 | Lecture 14: |
|
| ||
16 | Mon | Oct 29 | Lecture 15: |
|
| ||
17 | Wed | Oct 31 | Lecture 16: |
|
| ||
18 | Mon | Nov 05 | Lecture 17: |
|
| ||
19 | Wed | Nov 07 | Lecture 18: Task Affinity with Places (contd) |
|
| ||
20 | Mon | Nov 12 | Lecture 19: Midterm Summary |
|
|
| |
21 | Wed | Nov 14 | Lecture 20: |
|
| ||
22 | Mon | Nov 19 | Lecture 21: |
| |||
23 | Wed | Nov 21 | Lecture 22: |
| |||
24 | Mon | Nov 26 | Lecture 23: |
|
| ||
25 | Wed | Nov 28 | Lecture 24: |
|
| ||
26 | Mon | Mar 16 | Lecture 25: |
|
| ||
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: |
|
|
| |
30 | Mon | Mar 28 | Lecture 29: Java Threads (contd), Java synchronized statement |
|
| ||
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 |
|
| ||
34 | Mon | Apr 06 | Lecture 33: |
|
| ||
35 | Wed | Apr 09 | Lecture 34: Message Passing Interface (MPI, contd) |
| |||
36 | Mon | Apr 11 | Lecture 35: Cloud Computing, Map Reduce |
|
| ||
37 | Wed | Apr 13 | Lecture 36: Map Reduce (contd) |
|
| ||
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
Students with disabilities are encouraged to contact me during the first two weeks of class regarding any special needs. Students with disabilities should also contact Disabled Student Services in the Ley Student Center and the Rice Disability Support Services.