DSA

Distributed Algorithms (DSA) [Summer 2025]

The lecture “Distributed Systems Algorithms” covers methods that allow for functional and productive distributed computer systems. Such a distributed system employs multiple independent subsystems to fulfill a certain task. It will, however, appear to the user a coherent single system. To achieve this goal, the different subsystems need to obtain common knowledge. Distributed across independent subsystems causes multiple challenges that will be addresses in this lecture: subsystems need to be discoverable, they need to reach consensus, replicated data needs to be kept in a consistent state across the subsystems, faults in single subsystems need to be tolerated, and resources of the entire distributed system should be used efficiently such that the given task is fulfilled effectively and efficiently.

Note: this course succeeds the previous course “Distributed Systems”. You be granted credits for this course if you have already successfully taken “Distributed Systems”.

Organization

Literature

  • Maarten van Steen and Andrew S. Tanenbaum, Distributed Systems – Principles and Paradigms, Pearson. (PDF @author)