Distributed Algorithms

3 Credits · Level: Graduate, Undergraduate

This course focuses on the design and analysis of distributed algorithms, which are algorithms that are run at multiple locations or entities that must cooperate to solve problems. Such algorithms are useful in many settings, including coordination of servers in data centers and synchronization of the cores in multiprocessor computer chips. Certain distributed algorithms can also be used to explain behavior observed in the natural world. In this course, students will learn the standard models for distributed systems and classical distributed algorithms. The student will also learn a collection of more recent results. The course will primarily address design and analysis of distributed algorithms.