CAS 769 / Distributed Algorithms

3 unit(s)

This course we will study distributed computer systems, especially loosely-coupled and failure-prone ones. The course will cover formal models, algorithm design and analysis, lower bounds, and impossibility proofs. The students are expected to learn:
• fundamental models, problems, algorithms, lower bound and impossibility results, and proof techniques in distributed computing,
• design new distributed algorithms for new situations, using as building blocks the algorithms and techniques learned,
• how to apply lower bounds and impossibility results learned to new situations where appropriate,
• how to incorporate and implement distributed algorithms to build larger systems to gain speedup and achieve resiliency.