SDSU CS 662 Theory of Parallel Algorithms

[To Course Home Page]
San Diego State University -- This page last updated January 29, 1996

Theory of Parallel Algorithms - CS 662 Spring 1996

Instructor: Roger Whitney
Office: P-243
Phone: 594-3535

Course www site:
All course handouts will be delivered via WWW at the above URL. There links to the course home page from Some of the pages require a Web browser that support tables. A bug in version 1.x of Netscape requires you to set the disk cache to zero before you print long pages. Some of the notes on the course WWW pages use subscripts and superscripts. Netscape2.0b6 does render them properly, while Netscape 1.x does not.

Texts: The Design and Analysis of Parallel Algorithms by Selim Akl
The SR Programming Language: Concurrency in Practice by Andrews and Olsson
How to Write Parallel Programs by Carriero and Gelernter

Other sources:
JáJá, Joseph. An Introduction to Parallel Algorithms. Addison-Wesley, 1992.
Leighton, F. Thomson. An Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, 1992.

Grading : Your grade in this course will be determined as follows:
Homework and Programs:30%

Cheating: Any one caught cheating will receive an F in the course.

Course Outline:
Introduction to course
SrAndrewchap 2-12, 14
Writing parrallel programsCarrierochap 2, parts of 5-8
IntroductionAklchap 1
SelectionAklchap 2
MergingAklchap 3
SortingAklchap 4
SearchingAklchap 5
Matrix OperationsAklchap 7
Numerical problemsAklchap 8
Graph TheoryAklchap 10