Uni-Logo
Algorithms and Complexity
 


Verteilte Systeme / Distributed Systems
Graduate Course - Summer Term 2019
Fabian Kuhn

 


Course description

The course provides an introduction to the fundamentals of distributed systems and algorithms. The course will in particular cover the following topics:

  • distributed systems models
  • time and global states in distributed systems
  • sychronous and asynchronous systems
  • fault tolerance
  • basic distributed algorithms for coordination and agreement tasks
  • basic distributed network algorithms
  • distributed and parallel graph algorithms
  • impossibility results and lower bounds


Lectures and Exercises

  • Lecture: Monday 14:00 - 16:00, 101-01-009/013
  • Exercise Tutorial: Wednesday 14:00 - 16:00, 101-01-009/013

The last lecture is on 15.07.2019, the last tutorial on 24.07.2019.


Lecture Material

All slides and recordings can be found on our Webserver.


Exercise Sheets

If you want feedback to your solution, you can submit them to philipp.bamberger(at)cs.uni-freiburg.de or bring it as hard copy to the exercise lessons.


Week Assigned Date Due Date Exercises Sample Solution
1 01.05.2019 08.05.2019 Exercise 01 Solution 01
2 08.05.2019 15.05.2019 Exercise 02 Solution 02
3 15.05.2019 29.05.2019 Exercise 03 Solution 03
4 26.05.2019 05.06.2019 Exercise 04 Solution 04
5 05.06.2019 19.06.2019 Exercise 05 Solution 05
6 19.06.2019 26.06.2019 Exercise 06 Solution 06
7 26.06.2019 03.07.2019 Exercise 07 Solution 07
8 03.07.2019 10.07.2019 Exercise 08 Solution 08
9 10.07.2019 17.07.2019 Exercise 09 Solution 09
9 22.07.2019 24.07.2019 Exercise 10

Literature

Some of the content is for example covered by the following books:

Distributed Computing: Fundamentals, Simulations and Advanced Topics
Hagit Attiya, Jennifer Welch.
McGraw-Hill Publishing, 1998, ISBN 0-07-709352 6

Distributed Computing: A Locality-Sensitive Approach
David Peleg.
Society for Industrial and Applied Mathematics (SIAM), 2000, ISBN 0-89871-464-8

Additional literature will be provided in the lecture.