ENEE651

Parallel Algorithms

Reviews for this courseTestudo

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.

Past Semesters

Uzi Vishkin

1 review
Average rating: 3.00

Uzi Vishkin

1 review
Average rating: 3.00

Uzi Vishkin

1 review
Average rating: 3.00

During the Spring 2020 and Spring 2021 semesters, students could choose to take some of their courses pass-fail mid-semester which skews grade data aggregated across multiple semesters.

Average GPA of 3.36 between 76 students*

ENEE651 Grade Distribution+-05101520253035404550% of studentsABCDFWother
A-: 13.16%
A: 23.68%
A+: 9.21%
B-: 10.53%
B: 22.37%
B+: 11.84%
C+: 1.32%
W: 2.63%
other: 5.26%
* "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.