Number of hours
- Lectures 18.0
- Projects -
- Tutorials -
- Internship -
- Laboratory works -
- Written tests -
ECTS
ECTS 3.0
Goal(s)
The objectives of this course are:
- to study the basic concepts used to design distributed algorithms: processes, failures, etc.
- to study a set of distributed algorithms that are used in modern distributed systems.
At the end of the course, the student will be familiar with a set of widely used algorithms. In particular, the following families of algorithms will be introduced: consensus algorithms, broadcast algorithms, synchronisation algorithms, etc.
Responsible(s)
Vivien QUEMA
Content(s)
The course starts with a description of the main concepts used in distributed algorithms: processes, failures, synchronous vs. asynchronous communications, failure detectors, etc.
We then present a set of distributed algorithms and study the impact of the assumptions (regarding process failures, failure detection, etc.) on the design of the algorithms.
We finally study ways to assess the performance of distributed systems, both theoretically and experimentally.
PrerequisitesBasic notions of operating systems.
Basic notions of networks.
Test
There is a written exam (E1).
The exam lasts 2h.
The mark is that obtained at the written exam:
M = E1
The exam is given in english only 
Calendar
The course exists in the following branches:
- Curriculum - Master 2 in Computer Science - Semester 9 (this course is given in english only
) - Curriculum - Master 2 in Computer Science - Semester 9 (this course is given in english only )
Additional Information
Course ID : WMM9MO39
Course language(s):
You can find this course among all other courses.
Bibliography
Reliable and Secure Distributed Systems by C. Cachin, R. Guerraoui, and L. Rodrigues.