Uni-Logo
Algorithms and Complexity
 


(Theory of) Distributed Systems
Summer Term 2024
Fabian Kuhn

 



Lecture Recordings and Material


Date Topic Recording Slides Reading Material

17.04.2024 Introduction,
Two Generals
Introduction: Chapter 1 and Chapter 2 of [Aspnes]
Two Generals: Chapter 8 of [Aspnes]

22.04.2024 Broadcast, Convergecast, Spanning Trees Chapter 2 of [Wattenhofer]
Chapter 3 and Chapter 4 of [Aspnes]

29.04.2024 Leader Election in Rings Chapter 3 of [Wattenhofer]
Chapter 5 of [Aspnes]

06.05.2024 Consensus I Chapter 11 and Chapter 18 of [Aspnes]
Chapter 11 of [Aspnes] proves the impossibility of asynchronous consensus for message-passing systems, while in the lecture, we did the same proof for shared memory systems. Chapter 18 of [Aspnes] contains much more details about the consensus hierarchy than discussed in the lecture.

13.05.2024 Consensus II Chapter 9 and Chapter 10 of [Aspnes]
Chapters 9 (on synchronous consensus) and 10 (on Byzantine agreement) of [Aspnes] contain more details than what we discussed in the lecture.

27.05.2024 Coloring and MIS The coloring algorithm for rooted trees also appears in Chapter 1 of [Wattenhofer]
The lecture was prepared and prerecorded by Alkida Balliu. In the lecture on 27.05., we summarize and discuss the content of the video and some small additional topics that are directly related to the content of the video lecture.

03.06.2023 Randomized Coloring & MIS The randomized MIS algorithm also appears in Chapter 7 of [Wattenhofer]
The lecture was prepared and recorded by Dennis Olivetti. In the lecture on 03.06., we summarize and discuss the content of the video and possibly some small additional topics that are directly related to the content of the video lecture.

10.06.2023 Locality Lower Bounds Linial's original version of the lower bound for 3-coloring rings is described in Chapter 8 of [Wattenhofer]. The simpler proof that was discussed in the lecture appeared in [Laurinharju,Suomela].
The lecture was prepared by Dennis Olivetti. For a version of the lecture that was prerecorded by Dennis Olivetti, see the video below.
prerecorded lecture

24.04.2024 CONGEST Model - Bandwidth Limitations See also Chapter 11 of [Wattenhofer].
The lecture was prepared by Alkida Balliu. For a version of the lecture that was prerecorded by Alkida Balliu, see the video below.
prerecorded lecture

01.07.2024 Synchronization Chapter 10 of [Wattenhofer].

08.07.2024 Massively Parallel Computations - Part I Further details and a more advanced coverage of the topic can for example be found in Chapter 3 of [Ghaffari: Massively Parallel Algorithms].

15.07.2024 Massively Parallel Computations - Part II Further details and a more advanced coverage of the topic can for example be found in Chapter 3 of [Ghaffari: Massively Parallel Algorithms].



Literature / Reading Material


  • [Aspnes] Lecture Theory of Distributed Systems of James Aspnes at Yale University
    Lecture notes of the lecture held in Spring 2020.

    [Wattenhofer] Lecture Principles of Distributed Computing of Roger Wattenhofer at ETH Zurich
    Lecture note collection.