Distributed Algorithms
Format: 3h UV
ECTS: 5
Teachers: Sebastian Forster and Martin Grösbacher
Language: German and English
Prerequisites: Algorithms and Data Structures, Discrete Mathematics for Computer Science, Statistics for Computer Science (recommended)
Contact:
This course introduces algorithmic questions and techniques in distributed systems. In particular, we consider algorithms for physically distributed systems in which (a) communication between processors is the major bottleneck and (b) every processor only has a local view of the communication network. These types of systems are relevant if the amount of data to store and process is too big for a centralized architecture. Topics: Leader Election, CONGEST Model, Synchronization, Maximal Independen Set, Graph Spanners, Shortest Path Algorithms, Rumor Spreading.
The compulsory attendance rate for this course 70%. The course integrates a lecture part and a tutorial part and the latter consists of theoretical and programming exercises.
Course Materials
Lecture Notes
Slides Course Overview
Slides 01
Slides 02
Slides 03
Slides Probability Theory
DA_PracticalAssignments
