Courses - Fall 2024
ENEE459P
Topics in Computer Engineering; Parallel Algorithms
Credits:
3
Grad Meth:
Reg
Prerequisite: ENEE351 or CMSC351. Credit only granted for ENEE459P, ENEE651, or CMSC751.
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.
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.
Flagship Institution of the University System of Maryland
University of Maryland, College Park, MD 20742, USA
/
Phone:
301.405.1000
Copyright
© 2024 University of Maryland
/
Privacy /
Web Accessibility
Contact us
with comments, questions and feedback
/