everything.study
CMSC 751

Parallel Algorithms

3 Credits

A presentation of the theory of parallel computers and parallel processing. Models of parallel processing and the relationships between these models. Techniques for the design and analysis of efficient parallel algorithms including parallel prefix, searching, sorting, graph problems, and algebraic problems. Theoretical limits of parallelism.

Prerequisites & course information

Cross-listed with: ENEE651 . Credit Only Granted for: ENEE459P, ENEE651 , ENEE759K or CMSC751 . Formerly: ENEE759K. Additional Information: Students must have prior coursework similar to the content offered in undergraduate courses CMSC451 or ENEE641 ; or students who have taken courses with comparable content may contact the department.

Sources