Home > Teaching > CS 646: Parallel Algorithms

CS 646: Parallel Algorithms

Course Contents:

-Complexity measure for a parallel algorithms.

-Parallel searching algorithms: maximum/minimum, median, K-th largest/smallest element. Parallel sorting algorithms.

-Parallel graph algorithms: parallel graph search &, tree traversal algorithms, parallel algorithms for connectivity problems, parallel algorithms for path problems.

 

Books and References:
  1. Joseph Jaja.An Introduction to Parallel Algorithms, Addison Wesley, 1992.
  2. H. Sparkias and A. Gibbon.Lecture notes on Parallel Computation, Cambridge University Press, 1993.
  3. Research papers.