Number of hours
- Lectures 15.0
- Projects -
- Tutorials -
- Internship -
- Laboratory works -
- Written tests -
ECTS
ECTS 1.5
Goal(s)
The objective is to master the basic algorithmic concepts underlying distributed systems. For instance, we will study the notions of machine failures, synchronous vs asynchronous communications, fault detection.
Responsible(s)
Karine ALTISEN
Content(s)
This module is about the basic algorithmic concepts underlying distributed systems. Within this part, we will study the following concepts: machine failures, synchronous vs asynchronous communications, fault detection, etc. We will illustrate these notions via the study of a set of algorithms that form the basis of most distributed systems (broadcast, consensus, etc.).
PrerequisitesNotions of concurrent programming.
Notions of operating systems.
Algorithms for centralized systems.
Test
Session 1: Written exam (2h).
Only hand-written notes are allowed.
Session 2: Written exam (2h).
Only hand-written notes are allowed.
note de session 1 = note de l'examen de session 1
note de session 2 = note de l'examen de session de rattrapage
Calendar
The course exists in the following branches:
- Curriculum - Information Systems Engineering - Semester 9
Additional Information
Course ID : 5MMALGR
Course language(s): 
The course is attached to the following structures:
You can find this course among all other courses.
Bibliography
Introduction to Reliable and Secure Distributed Programming.
Christian Cachin, Rachid Guerraoui, and Luís Rodrigues.
Fault-Tolerant Message-Passing Distributed Systems - An Algorithmic Approach
Michel Raynal