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 College. For general information on 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 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 |
|
|
| Parallel Array Sum | lec1-audio | HW0 HW1 (due by 11:59pm on Tuesday, Sep 11th) | ||||||
2 | Mon | Sep 10 | Lecture 2: Data Races and Determinism, Finish Accumulators, Futures (Tasks with Return Values), Dataflow Programming, Data-Driven Tasks |
|
| Parallel Array Sum (contd), Amdahl's Law, Weak vs. Strong Scaling, Data Races and Determinism | lec2-audio |
| |||||||
3 | Wed | Sep 12 | Lecture 3: Abstract vs. Real Performance, Seq clause, Forasync Loops, Loop Chunking, Forall Loops and Barrier Synchronization |
|
|
| Finish Accumulators, Futures (Tasks with Return Values), Dataflow Programming, Data-Driven Tasks |
| HW1 HW2 (due by 11:59pm on Tuesday, Sep 18th) | ||||||
4 | Mon | Sep 17 | Lecture 4: Parallel Prefix Sum algorithm, Parallel QuickSort, Point-to-point Synchronization, Phasers |
| Programming Patterns, Seq clause, Forall Loops, Barrier Synchronization |
|
| ||||||||
5 | Wed | Sep 19 | Lecture 5: Parallel MergeSortSystolic Algorithms, Parallel BitonicSort | Odd-Even Sort |
| HW3 HW2 (due by 11:59pm on Tuesday, Sep 25th) | |||||||||
6 | Mon | Sep 24 | Lecture 6: Collective and Point-to-point Synchronization with Phasers, Phased Forasync Loops, Phaser Accumulators, | Bounded Phasers, Memory Consistency Models, Summary of Deterministic Shared-Memory ParallelismLoop Chunking | lec5 | lec5 | lec6-audio |
| |||||||
| Module 2: Nondeterministic Shared-Memory Parallelism | |||||||||||||||
7 | Wed | Sep 26 | Lecture 7: Actors Critical sections and the Isolated statement, Atomic Variables | lec6lec7-audio | HW4 HW3 (due by 11:59pm on Thursday, Oct 2nd4th) | ||||||||||
8 | Mon | Oct 01 | Lecture 8: Systolic arrays, Systolic algorithms (*Module 3 topic) | Observationally Cooperative Scheduling (Guest lecturer: Prof. Melissa O'Neil) | lec8-slides |
|
| ||||||||
9 | Wed | Oct 03 | Lecture 9: Critical sections and the Isolated statement, Monitors, Atomic Variables, Linearizability of Concurrent Objectslec8Actors | lec9-slides | lec8lec9-audio |
| HW4 HW5 (due by 11:59pm on Friday, Oct 9th12th) | ||||||||
10 | Mon | Oct 08 | Lecture 10: Linearizability of Concurrent Objects (contd), Safety and Liveness Properties, Progress Guaranteeslec9 | lec10-slides | lec9lec10-audio |
|
| ||||||||
| Module 3: Distributed-Memory Parallelism | |||||||||||||||
11 | Wed | Oct 10 | Lecture 11: Task Affinity with Places, Message Passing Interface (MPI)lec10 | lec11-slides | lec10lec11-audio |
| HW6 HW5 (due by 11:59pm on Wednesday, Oct 16h17th) | ||||||||
12 | Mon | Oct 15 | Lecture 12: Cloud Computing, MapReduce, GPU Programminglec11 Message Passing Interface (contd) | lec12-slides | lec11lec12-audio |
|
|
|
| Module 4: Real-world Parallel Programming Models and Challenges | |||||
13 | Wed | Oct 17 | Lecture 13: Real-World Parallel Programming Models, Course Reviewlec12 | lec13-slides |
| Take-home Final Exam (3-hour duration, due by 5pm on Oct 19th) |
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
...