Go to Main Content

Brown University

 

HELP | EXIT

Detailed Course Information

 

Spring 2017
Sep 17, 2019
Transparent Image
  Select the desired Level or Schedule Type to find available classes for the course.

CSCI 2550 - Parallel Computation: Models, Algorithms, Limits
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.
1.000 Credit hours
1.000 Lecture hours

Levels: Graduate, Undergraduate
Schedule Types: Primary Meeting

Computer Science Department

Return to Previous New Search
Transparent Image
Skip to top of page
Release: 8.7.2.4