MITRO207 Distributed Computing and Combinatorial Topology

P4/2017

Prof. Petr Kuznetsov, office hours: C213-2, appointment by email
INFRES, Telecom ParisTech

Summary

Practically all computing systems, from fire alarms to Internet-scale services, are nowadays distributed: they consist of a number of computing units performing independent computations and communicating with each other to synchronize their activities. Our dependence on performance and reliability of distributed systems becomes more and more imminent. Therefore, understanding fundamentals of distributed computing is of crucial importance.

This course is devoted to the use of combinatorial topology, the approach that has recently been used to close several long-standing open questions in distributed computability. The course is based on the textbook by Maurice Herlihy, Dmitry Kozlov, and Sergio Rajsbaum, "Distributed Computing through Combinatorial Topology".

News
Slides and exercises
Literature

News

Slides and exercises

Date Class Exercises Solutions
28.04.2017 Introduction HW 1 solutions
05.05.2017 Two-process computations HW 2 solutions
12.05.2016 Basics of combinatorial topology HW 3 solutions
02.06.2016 Midterm Exam
02,09.06.2016 Colorless tasks HW 4 solutions
16-23.06.2016 Solving colorless tasks HW 5 solutions
29.06.2016 Q&A session
30.06.2016 Exam

Literature