TAPP = Parallel Computing: Theory and Practice

PA = Parallel Algorithms

CLRS = Introduction to Algorithms, 3rd Edition

Date Topic Reading Slides
Mon Jan, 06 Intro TAPP § 3.1, 3.2, CLRS § 27.1 Slides
Wed Jan, 08 First Attempt: Reduce TAPP § 5.1, 5.2, 13, CLRS § 27.1
Thu Jan, 09 Course Policy Test Due
Sun Jan, 12 Coding HW 0 Due
Mon Jan, 13 Models and Building Blocks TAPP § 5.1, 5.2, 13, CLRS § 27.1, 27.2 Slides
Wed Jan, 15 Sorting (Project 1 out) TAPP § 13, 14, CLRS § 27.2, 27.3 Slides
Sat Jan, 18 Coding HW 1 Due
Mon Jan, 20 Holiday!
Wed Jan, 22 Concurrency TAPP § 14, CLRS § 27.3 Slides
Thu Jan, 23 Written HW 1 Due
Mon Jan, 27 Graph I (Project 2 out) TAPP § 5, PA § 5 Slides
Wed Jan, 29 Graph II TAPP § 5, PA § 5 Slides
Thu Jan, 30 Coding HW 2 Due
Mon Feb, 03 Graph III TAPP § 5, PA § 5 Slides
Wed Feb, 05 Graph VI TAPP § 5, PA § 5 Slides
Thu Feb, 06 Project 1 Due + Proposal for (Optional) Presentation
Mon Feb, 10 Deterministic Parallelism Reading Slides
Wed Feb, 12 Parallel Binary Search Trees I PA § 6 Slides
Thu Feb, 13 Written HW 2 Due
Mon Feb, 17 Holiday!
Wed Feb, 19 Parallel Binary Search Trees II PA § 6 Slides
Thu Feb, 20 Project 2 Mid report Due
Mon Feb, 24 Parallel Binary Search Trees III PA § 6 Slides
Wed Feb, 26 Parallel Binary Search Trees VI PA § 6 Slides
Thu Feb, 27 Written HW3 Due
Mon Mar, 03 Take-Home Exam Pickup
Wed Mar, 05 Take-Home Exam
Mon Mar, 10 Presentations / Guest Lecture
Wed Mar, 12 Presentations / Guest Lecture
Sun Mar, 16 Project 2 Due