Prerequisites: CS 141; or equivalent; graduate standing
Description: 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.
Credit: May be taken Satisfactory (S) or No Credit (NC) with consent of instructor and graduate advisor.