CSCI2550

(Formerly CS255 )

Parallel Computation: Models, Algorithms, Limits

Instructor(s):
Course Home Page:
Offered This Year?  No
When Offered? Occasionally

Description

The theoretical foundations of parallel algorithmics. Analysis of the most important models of parallel computation, such as directed-acyclic computation graphs, shared memory and networks, and standard data-exchange schemes (common address space and message-passing). Algorithmic techniques with numerous examples are cast mostly in the data-parallel framework. Finally, limitations to parallelizability (P-completeness) are analyzed. The content of the course is likely to change as technology evolves. Written permission required for undergraduates.