Date			L#	Lecture	HW out	HW due	Reading
Jan	T	31	1	Course logistics; What is parallel computing and why should you care; Parallel computer classification			Wilkinson 1.1-1.2
Feb	F	3	2	Introduction to C for Java Programmers	1		A Crash Course in C or Vine Ch. 3-7
	T	7	3	Parallel Architectures; Some more C			Wilkinson 1.3-1.6
	F	10	4	Message passing; Intro to MPI			Wilkinson 2.1-2.2; Pacheco 1,2
	T	14	5	MPI's collective communication; computer accounts			Pacheco 3, 4
	F	17	6	Evaluating parallel programs	2	1	Eratosthenes' sieve, Wilkinson 2.3-2.5
	T	21	7	Embarrassingly Parallel Computations, Mandelbrot set			Wilkinson 3-3.2.2
	F	24	8	Monte Carlo (π), Pipelined Computations, zero time sorting			Wilkinson 3.2.3, 5.1-5.3.2
	T	28	9	Prime number calculation, linear equations			Wilkinson 5.3.3-5.4
Mar	F	3	11	Parallel Digital Halftoning by Error-Diffusion	3	2	Parallel Halftoning Paper
	T	7	12	Partitioning and Divide & Conquer			Wilkinson 4
	F	10	13	Synchronous Computation, Barriers, implementation			Wilkinson 6.1-6.2
	T	14	14	Local synchronization, heat distribution			Wilkinson 6.1.5, 6.1.6, 6.3.2
	F	17	15	Sorting	4	3	Wilkinson 9.1-9.3 (10.1-10.3)
	T	21		Spring Break
	F	24		Spring Break
	T	28	16	Image Processing, Review for midterm			Wilkinson 11.1-11.5 (12.1-12.5)
	F	31	17	Midterm Exam
Apr	T	4	18	Theoretical Models - The PRAM Model			Notes: Models
	F	7	19	PRAM hierarchy, Efficiency measures, NC	5	4	Notes: Models
	T	11	20	Fundamental parallel techniques, prefix sum, Brent's			Notes: Techniques
	F	14	21	List Ranking, Euler Tour			Notes: Techniques
	T	18	21	NO CLASS - MONDAY SCHEDULE
	F	21	22	Expression Tree Evaluation	6	5	Notes: Algorithms
	T	25		Graph representation, updating MST			Notes: Algorithms
	F	28	23	Pseudotree contraction, Edge list augmentation			Notes: Algorithms
May	T	2	24	Connected Components			Notes: Algorithms
	F	5	25	Minimum Spanning Trees			Notes: Algorithms
	T	9	26	Review for Final		6