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.
Prerequisite: CMSC451; or ENEE641; or students who have taken courses with comparable content may contact the department.
Cross-listed with: CMSC751.
Credit only granted for: ENEE459P, ENEE651, ENEE759K or CMSC751.
Semesters OfferedSpring 2018, Spring 2020, Fall 2022