This course takes a theoretical approach to studying distributed computer
systems, especially loosely-coupled and failure-prone ones.
The course covers formal models, algorithm design and analysis,
lower bounds, and impossibility proofs.
The final grade is based on
- homework exercises (50-60%) and
- a written project (40-50%).
systems, especially loosely-coupled and failure-prone ones.
The course covers formal models, algorithm design and analysis,
lower bounds, and impossibility proofs.
The final grade is based on
- homework exercises (50-60%) and
- a written project (40-50%).