Prerequisites: A minimum grade of “B-” in CS 520 and CS 567. (Second semester—odd years/3 credits)
An introduction to the theory of concurrent and distributed algorithms, with an emphasis on
formal analysis. The course will cover both synchronous and asynchronous algorithms. Topics
may include problems in: resource allocation, communication, consensus among distributed
processes, data consistency, deadlock detection and leader election.