Distributed Algorithms
Master course, Fall 2012
Prerequisites: none.
Note: this course is independent from the course Concurrent Algorithms.
News
Last updated: Dec 14, 2012
- Uploaded the solution to the midterm exam
- Uploaded Ex. 09
- Updated Ex. 08 solution.
- Uploaded Ex. 08 solution.
- Uploaded Ex. 08
- Uploaded course notes on Shared Memory
- Uploaded Ex. 07 solution.
- Uploaded Ex. 07
- Uploaded Ex. 06 solution.
- Uploaded course notes on Group Membership / Terminating Reliable Broadcast (November 12th)
- Uploaded Ex. 06
- Uploaded Ex. 05 solution.
- Uploaded course notes on Non-Blocking Atomic Commit (November 5th)
- Updated the date of the midterm exam (Monday, December 10th 2012, 15h15 and 16h00).
- Updated the date of the final exam (Monday, January 14th 2013, 16h15).
- Uploaded Ex. 05.
- Uploaded Ex. 04 solution.
- Uploaded course notes on Consensus (Oct 29th)
- Uploaded Ex. 04.
- Uploaded Ex. 03 solution.
- Uploaded Ex. 03.
- Uploaded Ex. 02 solution.
- Uploaded course notes on Causal Broadcast (Oct 15th)
- Uploaded Ex. 01 solution.
- Uploaded updated slides for reliable broadcast.
- Uploaded Ex. 01.
- Updated for the year 2012.
Dates and schedule
- The course is given on Mondays, 15:15−17:00, in ELA01.
- The exercises are given on Mondays, 17:15-18:00, in BC01 & BC03.
Teaching team
- Lecturers:
- Prof. Rachid Guerraoui, office INR 310, web page
- Teaching Assistants:
Textbook
- Rachid Guerraoui and Luis Rodrigues - Introduction to Reliable Distributed Programming, available at 'La Fontaine' (with a student discount) or at amazon.de.
- Christian Cachin, Rachid Guerraoui and Luis Rodrigues - Introduction to Reliable and Secure Distributed Programming
Additional Material
Slides and exercises
Note that the slides will most likely be edited as the semester progresses, so make sure you have the latest version.
| Date | Lecture | Slides | Exercises |
|---|---|---|---|
| September 24th | Introduction | pdf ppt | — |
| October 1st | Introduction / Reliable broadcast | pdf ppt | the problem set solution |
| October 8th | Reliable broadcast | the problem set solution | |
| October 15th | Causal Broadcast | pdf ppt | the problem set solution |
| October 22th | Total Order Broadcast | pdf ppt | the problem set solution |
| October 29th | Consensus | pdf ppt | the problem set solution |
| November 5th | Non-Blocking Atomic Commit | pdf ppt | the problem set solution |
| November 12th | Group Membership Terminating Reliable Broadcast | pdf ppt pdf ppt | the problem set solution |
| November 19th | Group Membership View Synchrony | the problem set solution | |
| November 26th | Shared Memory (regular registers) | pdf#1 ppt#1 pdf#2 ppt#2 | the problem set solution |
| December 3rd | Shared Memory (atomic registers) | pdf#3 ppt#3 pdf#4 ppt#4 | |
| December 10th | Midterm | ||
| December 17th | No lectures. We will use the lecture time slots to explain the midterm solutions. | ||
Grades and Exam
The final exam will be written and closed-book and will take place on Monday, January 14th 2013, at 16h15.
Old Exams
Midterm
The midterm exam will take place on Monday, December 10th. The class will be split in two halves, which will take the exam at 15h15 and 16h00, respectively. Students with last name starting with A..L (inclusive), should come at 15h15. Students with last name starting with M..Z (inclusive) should come at 16h00.
The solution to the midterm: miterm_solution
The grades from the midterm: da12-grades