CSE 4500 (228)
Parallel Systems
Fall 2009
Syllabus (preliminary) [doc]
.
Class Notes Set 1 [pdf]
Class Notes Set 2 [pdf]
Class Notes Set 3 [pdf]
Homework 2 [doc]
Class Notes Set 4 [pdf]
Parallel prefix and list ranking illustrations. Fast CRCW maximum computation.
Handout: O(1) time minimum on CRCW PRAM [pdf]
This handout describes a fast, O(1) time, CRCW algorithm for computing minimum (or maximum) of
n
values using a quadratic number of processors. It is similar to the "tournament" algorithm described in class, but uses a slightly different approach.
Homework 3 [doc]
Due date: October 13, 2009
Sample Solution [pdf]
Class Notes Set 5 [pdf]
Homework 4 [doc]
Due date: October 29, 2009
Sample Solution [pdf]
Example Midterm Test [pdf]
Homework 5 [doc]
Due date: November 17, 2009
Class Notes Set 6 [pdf]
