George Mason University 


CS683 - Parallel Algorithms - Spring 2009

Tuesday 7:20 - 10:00, IN 206 

Prerequisites | Description | Readings | Syllabus | Grading 

This page last updated on 1/14/09. 

Professor Dana Richards 


Office hours: Tuesday and Thursday 11:00-12:00 or by appt.

Sci&Tech II Room 425 


CS583 - Analysis of Algorithms

CS635 - Foundations of Parallel Computation (Recommended) 


Introduction to a variety of algorithms which illustrate principles for both the design and analysis of efficient parallel algorithms. The emphasis will be on the PRAM model. Topics covered include sorting, graph algorithms, and geometry. 



The first five chapters will be covered in the first two thirds of the semester. Student presentations will be given at the end of the semester. 


First exam -- 35%

Second exam -- 35%

Presentation -- 30%

The two exams, the midterm and the final, each cover about a half of the semester; i.e., the final is not cumulative. Each exam is take-home and open-book. 

Late work and missed exams will not be allowed without an official university excuse. Exam dates will be announced. 

The presentation will be of a relevant paper in the literature. Back to the top.

No laptops, etc. (If you need a laptop for note-taking then speak to me.)