ENEE651
Parallel Algorithms
Prerequisite: CMSC451; or ENEE641; or students who have taken courses with comparable content may contact the department. Jointly offered wit h CMSC751. Credit only granted for: ENEE651, ENEE759K or CMSC751. Formerly: ENEE759K. 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.
Fall 2024
7 reviews
Average rating:
2.86
Past Semesters
7 reviews
Average rating:
2.86
7 reviews
Average rating:
2.86
* "W"s are considered to be 0.0 quality points. "Other" grades are not factored into GPA calculation. Grade data not guaranteed to be correct.