CS 214: PARALLEL ALGORITHMS
University of California, Riverside
4 Units, Lecture, 3 hours; research, 3 hours. Prerequisite(s): CS 141; or equivalent; graduate standing. Covers basic concepts of parallel shared-memory algorithms such as theoretical models, scheduling, and concurrency. Addresses techniques for designing efficient parallel algorithms for computational problems in a variety of areas including sorting, searching, algebra, graph theory, data structures, computational geometry, and scheduling. Emphasizes correctness proofs and rigorous performance analysis. May be taken Satisfactory (S) or No Credit (NC) with consent of instructor and graduate advisor.
Average GPA: 3.66
Grade distribution records: 115 students across 4 terms.
Grade distribution
| Grade | Students | Percent |
|---|---|---|
| A+ | 41 | 35.7% |
| A | 31 | 27.0% |
| A- | 12 | 10.4% |
| B+ | 12 | 10.4% |
| B | 9 | 7.8% |
| B- | 5 | 4.3% |
| C+ | 1 | 0.9% |
| C | 1 | 0.9% |
| F | 2 | 1.7% |
| NP | 1 | 0.9% |
Based on 115 student grade records across 4 terms and 2 professors.