Distributed Algorithms and Systems

Catalog description

Credits 3. 3 Lecture Hours. Introduction to fundamental algorithmic results in distributed computing systems; leader election, mutual exclusion, consensus, logical time and causality, distributed snapshots, algorithmic fault tolerance, shared memory, clock synchronization. Prerequisites: CSCE 411 or equivalent or approval of instructor.