Coursebooks 2017-2018

PDF
 

Caution, these contents corresponds to the coursebooks of last year


Distributed algorithms

CS-451

Lecturer(s) :

Guerraoui Rachid

Language:

English

Summary

Computing is often distributed over several machines, in a local IP-like network, a cloud or in a P2P network. Failures are common and computations need to proceed despite partial failures of machines or communication links. The foundations of reliable distributed computing will be studied.

Content

Reliable broadcast       
Causal Broadcast   
Total Order Broadcast   
Consensus   
Non-Blocking Atomic Commit  
Group Membership, View Synchrony
Terminating Reliable Broadcast   
Shared Memory in Message Passing System
Byzantine Fault Tolerance 
Self Stabilization
Population protocols   (models of mobile networks)

Keywords

Distributed algorithms, checkpointing, replication, consensus, atomic broadcast, ditributed transactions, atomic commitment, 2PC.

Learning Prerequisites

Required courses

Basics of Algorithms, networking and operating systems

Recommended courses

The lecture is orthogonal to the one on concurrent algorithms: they can be taken in parallel.

Learning Outcomes

By the end of the course, the student must be able to:

Teaching methods

Ex cathedera

Assessment methods

Mid-term and final exams.

Supervision

Office hours Yes
Assistants Yes
Forum Yes

Resources

Ressources en bibliothèque
Notes/Handbook

Reliable and Secure Distributed Programming
Springer Verlag
C. Cachin, R. Guerraoui, L. Rodrigues

Websites
Videos

In the programs

Reference week

 MoTuWeThFr
8-9     
9-10     
10-11     
11-12     
12-13     
13-14     
14-15     
15-16     
16-17     
17-18     
18-19     
19-20     
20-21     
21-22     
Under construction
 
      Lecture
      Exercise, TP
      Project, other

legend

  • Autumn semester
  • Winter sessions
  • Spring semester
  • Summer sessions
  • Lecture in French
  • Lecture in English
  • Lecture in German