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.
Other grades
University of California, Riverside
Reviews, study tips, and grade data for CS 214 at UCR. 4 Units, Lecture, 3 hours; research, 3 hours. Prerequisite(s): CS 141; or equivalent; graduate standing…
Related topic in CS
Related topic in CS
Related topic in CS
Related topic in CS
Related topic in CS
Related topic in CS
The course page is taking longer to load. This summary is still available.
We could not load the full course details. This summary is still available.
Still loading. This can take a moment on a slow connection.
Loading My Class Grades