CS-5331

Parallel Algorithms

Spring 2003

Quick Info

This class emphasizes the principles used in the development of algorithms for parallel computers, including the topics: programming paradigms, implementation, analysis and performance evaluation. Algorithms in the areas of scientific computation and nonnumeric processing are considered, as are software tools for performance visualization and debugging.

We shall use the following text:

``Introduction to parallel computing, 2nd edition'' by Kumar, Karypis, Grama and Gupta.
Additional materials will be given in class.

If you have questions, come and see me in 226C Fisher every Tuesday after class. If you cannot make it, please send me e-mail to arrange for a mutual aggreeable time.

For detailed information please consult the syllabus ( PDF).

There will be several homework projects, on which the final grade will be based.

Additional Material

Peter S. Pacheco - A User's Guide to MPI ( ps.gz).
OpenMP: C specification, Fortran specification, and tutorial.

Term Projects

The list of term projects.

Homework

Hw #1. Due Tuesday Feb 4.
Hw #2. Due Tuesday Feb 11.
Hw #3. Due Thursday Feb 27.
Hw #4. Due Tuesday March 25.
Hw #5. Due Tuesday March 25. (see also hello.c, hello.f).
Hw #6. Due Tuesday April 15.
Hw #7. Due Thursday April 24.

asandu@mtu.edu (Adrian Sandu)
http://www.cs.mtu.edu/~asandu/Courses/CS5331/CS5331.html