1. Algorithms and Complexity (Freiburg)
    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.



    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.