TAPP = Parallel Computing: Theory and Practice

PA = Parallel Algorithms

CLRS = Introduction to Algorithms, 3rd Edition

	Date	Topic	Reading	Slides
Fri	Sept, 29	Intro & Policy		Slides
Mon	Oct, 02	Intro	TAPP § 3.1, 3.2, CLRS § 27.1	Slides
Tue	Oct, 03	Class Policy Test Due
Wed	Oct, 04	Case study: reduce	TAPP § 5.1, 5.2, 13, CLRS § 27.1	Slides
Fri	Oct, 06	Models	TAPP § 5.1, 5.2, 13	Slides
Mon	Oct, 09	Basic building blocks	TAPP § 13, 14, CLRS § 27.2	Slides
Tue	Oct, 10	Coding HW0 Due
Wed	Oct, 11	Basic building blocks	TAPP § 14, CLRS § 27.3	Slides
Fri	Oct, 13	Basic building blocks	TAPP § 14, CLRS § 27.3	Slides
Mon	Oct, 16	Concurrency and Hash Table	TAPP § 5	Slides
Tue	Oct, 17	Written HW1 Due
Wed	Oct, 18	Concurrency and Hash Table	TAPP § 5	Slides
Fri	Oct, 20	Deterministic Parallelism I	Reading	Slides
Mon	Oct, 23	Deterministic Parallelism II	Reading	Slides
Tue	Oct, 24	Coding HW1 Due
Wed	Oct, 25	Graph I	TAPP § 5, PA § 5	Slides
Fri	Oct, 27	Graph II	TAPP § 5, PA § 5	Slides
Mon	Oct, 30	Graph III	TAPP § 5, PA § 5	Slides
Tue	Oct, 31	Project 2 Proposal Due
Wed	Nov, 01	Graph VI	TAPP § 5, PA § 5	Slides
Fri	Nov, 03	Graph V	TAPP § 5, PA § 5	Slides
Mon	Nov, 06	BST I	PA § 6	Slides
Tue	Nov, 07	Coding HW2 Due
Wed	Nov, 08	BST II	PA § 6	Slides
Fri	Nov, 10	Holiday!
Mon	Nov, 13	BST III	PA § 6	Slides
Tue	Nov, 14	Written HW2 Due
Wed	Nov, 15	BST IV	PA § 6	Slides
Fri	Nov, 17	BST V	PA § 6	Slides
Mon	Nov, 20	I/O-efficient algorithms		Slides
Tue	Nov, 21	Project 1 Due
Wed	Nov, 22	Happy Thanksgiving!
Fri	Nov, 24	Happy Thanksgiving!
Mon	Nov, 27	scheduling		Slides
Tue	Nov, 28	Written HW3 Due
Wed	Nov, 29	Review + take-home Midterm Exam pickup
Fri	Dec, 01	Take-home Midterm Exam Submission
Mon	Dec, 04	Presentation
Wed	Dec, 06	Presentation
Fri	Dec, 08	Presentation + end-of-class party!
Sun	Dec, 10	Project 2 Due