Distributed Computing

Catalog description

An introduction to foundational concepts in distributed algorithms and systems is provided in this course. The algorithms are used in distributed systems and comprise independent processes that communicate over a network and cooperate to solve problems. We will study elements of distributed system design with the emphasis on distributed algorithms for determining logical time, global state and snapshot recording, leader election, consensus and agreement problems, message ordering, termination detection, distributed mutual exclusion, deadlock detection, check pointing and rollback recovery, failure detectors and self-stabilization, and selected topics in peer-to-peer systems. A recommended requisite for this course is an understanding of operating systems concepts. Prereq: ( CSDS 310 or CSDS 410 with a C or higher) and ( CSDS 233 or ECSE 233 with a C or higher) or Graduate student standing.