Schedule
TAPP = Parallel Computing: Theory and Practice
PA = Parallel Algorithms
Date | Topic | Reading | Slides | Notes | |
---|---|---|---|---|---|
Mon | 9-Jan | Intro | TAPP § 3.1, 3.2 |
HW0 out HW1 out | |
Wed | 11-Jan | Models | TAPP § 5.1, 5.2, 13 | ||
Fri | 13-Jan | Implementation | TAPP § 5.1, 5.2, 6, 17 | ||
Mon | 16-Jan | MLK day (No class) | |||
Wed | 18-Jan | Parallel sequences | TAPP § 13 | HW0 due | |
Fri | 20-Jan | Divide-and-conquer | TAPP § 14 | ||
Mon | 23-Jan | sorting I | TAPP § 14 | Project 1 out | |
Wed | 25-Jan | sorting II | TAPP § 14 |
HW1 due HW2 out | |
Fri | 27-Jan | Concurrency and hash table | TAPP § 5 | ||
Mon | 30-Jan | Deterministic Parallelism | |||
Wed | 1-Feb | Deterministic Parallelism | Reading | Quiz 1 | |
Fri | 3-Feb | Parallel Trees I | PA § 6 | ||
Mon | 6-Feb | Parallel Trees II | PA § 6 |
HW2 due HW3 out | |
Wed | 8-Feb | Parallel Trees III | PA § 6 | Project 1 mid report | |
Fri | 10-Feb | Parallel Trees IV | PA § 6 | ||
Mon | 13-Feb | Graph I | TAPP § 5, PA § 5 | Project 2 out | |
Wed | 15-Feb | Graph II | TAPP § 5, PA § 5 | ||
Fri | 17-Feb | Graph III | TAPP § 5, PA § 5 | ||
Mon | 20-Feb | Presidents Day (No class) |
HW3 due HW4 out | ||
Wed | 22-Feb | Graph IV | TAPP § 5, PA § 5 | ||
Fri | 24-Feb | Graph V | TAPP § 5, PA § 5 |
Quiz 2 Project 1 due | |
Mon | 27-Feb | Midterm start | Midterm | ||
Wed | 1-Mar | Midterm end | Midterm | ||
Fri | 3-Mar | Modern architecture | Project 2 mid report | ||
Mon | 6-Mar | I/O efficient algorithms | HW4 due | ||
Wed | 8-Mar | I/O efficient algorithms | |||
Fri | 10-Mar | I/O efficient algorithms | |||
Mon | 13-Mar | Scheduler | Quiz 2 | ||
Wed | 15-Mar | Presentation | Project 2 due | ||
Fri | 17-Mar | Presentation |