Graduate Computer Science

CS G290: Distributed Algorithms

Covers the design and analysis of algorithms and problems arising in distributed systems, with emphasis on network algorithms. The main concerns are efficiency of computation and communication, fault tolerance, and asynchrony. Topics include leader election, graph algorithms, datalink protocols, packet routing, logical synchronization and clock synchronization, resource allocation, self-stabilization of network protocols, graph partitions.
Prerequisites:
CS G113/CS G713 or permission of instructor. MS: Theory
Credit hours: 4
Course offerings: