Distributed Computing LPD

Concurrent Algorithms

2017, autumn semester. Master course.

Prerequisites: none.

Note: this course is independent from the course Distributed Algorithms.


  • [19.09.2017] There will be no exercise session the first week.
  • [30.08.2017] The website is online.

Dates and schedule

  • The course lectures are every Tuesday 8:15-10:00, in INM200.
  • The exercise sessions are every Tuesday 13:15-14:00, in INR219.
  • Tentative bonus (midterm) exam date: 1st week of December
  • Final exam date: to be decided by EPFL administration (January-February)

Teaching team

  • Professor: Rachid Guerraoui, office INR 310, web page.
  • Assistants:
    • Igor Zablotchi, office INR 326, web page. Office hours: Monday 10:30-11:30, or by appointment.
    • Jingjing Wang, office INR 327, web page. Office hours: Wednesday 10:00-11:00, or by appointment.

Slides and exercises

Lecture Slides Exercises
Introduction pdf No exercise session
Registers pdf
Complementary Slides
The Power of Registers pdf
The Limitations of Registers pdf
The Limitations of Registers (Cont'd) pdf
Universal Constructions pdf
Consensus with Timing pdf
Concurrent Data Structures pptx pdf
Anonymous processes pdf
Practical Concurrency pptx pdf
Transactional memory pdf
Faulty base objects
Shared Memory and Message Passing
pptx pdf

Information on exercises, grading, and exam

  • Exercises are made available on the course webpage.
  • Exercises are not graded and do not count towards the final grade. However, solving the exercises will help you prepare for the final exam.
  • Solutions to the exercises will be given during the exercise sessions one week after the exercises were given. Also, solutions will be available on the course webpage one week after the exercises were given.
  • The final exam and the midterm will be written and without books or any other material.

Auxiliary documents

  • An overview paper on transactional memory pdf

Lecture notes from 2009/2010

  • Registers, Ivan Kviatkevitch pdf
  • Writing while reading and Tromp's algorithm, Laurent Bindschaedler pdf
  • Consensus with timing assumptions, Utkarsh Upadhyay pdf
  • Computing with anonymous processes, Shabnam Ataee pdf
  • Object Implementation out of faulty base objects, Shabnam Ataee pdf
  • Set Agreement, Mihailo Velimirovic pdf
  • The Power and Limitations of Registers, Ruben Braojos pdf