CSCI 361 - Parallelism and Concurrency

We investigate the theory behind achieving high performance on high-throughput multiprocessor systems. In the first half of the course we develop and analyze parallel algorithms for tightly coupled synchronous systems that use either shared memory or message passing to communicate. In the second half we look at loosely coupled systems, studying efficient mechanisms for synchronizing access to shared data structures, and focusing particularly on proving their correctness. Though we look at abstract models of these systems throughout, students will also be asked to implement their ideas on current multiprocessor hardware.

Unit(s): 1
Group Distribution Requirement(s): Distribution Group III
Prerequisite(s): CSCI 221, and CSCI 382 or MATH 382
Instructional Method: Lecture-conference
Grading Mode: Letter grading (A-F)
Not offered: 2026-27
Group Distribution Learning Outcome(s):

Use and evaluate quantitative data or modeling, or use logical/mathematical reasoning to evaluate, test or prove statements.
Given a problem or question, formulate a hypothesis or conjecture, and design an experiment, collect data, or use mathematical reasoning to test or validate it.