CSCE 6150 - Complexity of Parallel Computation

3 hours

Models of parallel computation-justification and buildability; inherent parallelism and communication costs; techniques for efficient parallelization. Lower and upper complexity bounds; the classes NC and SC: P-complete problems; the parallel computation thesis.

Prerequisite(s): CSCE 5150 or CSCE 5160.