Skip to content
Technische Universität Berlin Deutsch
Course catalog and module transfer system

Algorithms for Distributed SystemsModule description #41127 / Version 1

← Module page Deutsche Fassung
This module description is not valid in the current semester (Winter semester 2026/27). Current version (v3)
Module / Version#41127 / #1
ValidityWinter semester 2023/24 – Summer semester 2024
Available language(s)English
Credit points6
Person responsible for the moduleSchmid, Stefan
GradingGraded
Exam formatOral exam
Language(s) of instructionEnglish

Affiliation

FacultyFakultät IV
InstituteInstitut für Telekommunikationssysteme
Academic chair34331700 FG Intelligent Networks and Management of Distributed Systems (INET)

Contact

OfficeEN 18
Contact personSchmid, Stefan
E-mail addressstefan.schmid@tu-berlin.de
Websitehttps://www.tu.berlin/eninet

Learning outcomes

Most modern computer systems are inherently distributed and networked, including multi-core computers, machine-learning clusters, wireless sensorsystems, datacenters, peer-to-peer systems, blockchain or cryptocurrencies, to just give some examples. In order to operate correctly and efficiently, all these systems rely on clever algorithms. Some of the underlying algorithms are fundamentaland are used by most of the systems, others are specialized and exploit specific features of the particular distributed system.

The goal of the module is to provide the students with tools and techniques to reason about efficient algorithms for distributed systems.

The lecture is problem-oriented and structured into different fundamental principles, such as Distributed Coordination, Decentralization, Randomization, etc. Each lecture will cover a different basic problem (such as Load Balancing, Leader Election, Symmetry Breaking, etc., arising in various different applications, from the Internet over distributed data analytics to sensor networks) and will be self-contained.

By the end of the lecture, the student will be able to develop her/his own distributed algorithms, and formally prove correctness as well as complexity guarantees (e.g., on the computational complexity or the communication complexity).

The students will also have a good understanding of when to apply which principle, i.e., where randomization can be useful and where not, or to which extent a distributed system should be decentralized. The students will further have a good idea of the different natures of today's distributed systems. If time permits, we will also extend our discussion beyond computer systems and have an algorithmic look at social and biological networks.

This module is principally designed to impart:
technical skills: 40x, method skills: 40x, system skills 10x, social skills 10x

Content

The lectures revolve around fundamental problems and design principles. A tentative outline of the main topics to be covered in the course are

* Models for Distributed Systems: from shared-memory over datacenter applications to Internet-scale systems
* Algorithmic techniques for small ("shared memory") and large distributed systems ("distributed graph algorithms")
* Decentralization: why and how? Complexity Measures
* Randomization: why and how? Basic Tools
* Algorithms: Local Algorithms, Random Algorithms, Online Algorithms, Dynamic Programming
* Distributed Algorithms for Leader Election, Coloring, Maximal Independent Sets, Medium Access
* Resource Allocation and Embedding (e.g., energy, bandwidth, CPU)
* Social and Biological Networks: An Algorithmic Perspective

Module components

Compulsory area

The following courses are mandatory for this module:

CoursesTypeNumberFrequencyLanguageHours per weekCourse catalog
Algorithms for Distributed SystemsIntegrated course432 L 818 Winter semester[en]4 ISIS

Workload and credit points

Algorithms for Distributed Systems (Integrated course)

Workload descriptionMultiplierHoursTotal
Attendance lecture152 h30 h
Attendance tutorial152 h30 h
Solving excercises154 h60 h
Preparation and rework of the lecture153 h45 h
Preparation for the exam115 h15 h
180 h

The workload of the module adds up to 180 hours. The module therefore comprises 6 credit points.

Description of teaching and learning methods

* Common lecture
* Exercises and/or programming assignments: to be issued weekly; half to be solved individually and half to be solved in groups of 2 (if the class has an odd number of participants then there will be a group of 3); to be graded by the instructor; solutions to be jointly discussed (by instructor + students) during the tutorials * English language for both the lecture and the tutorials.

Requirements for participation and examination

Desirable prerequisites for participation in the courses:

* Module "Diskrete Strukturen" or module "Algorithmen und Datenstrukturen"
* Module "Rechnernetze und Verteilte Systeme"
* Module "Network Architectures - Basics"
* Good knowledge of the English language

Mandatory requirements for the module examination registration:

This module has no examination requirements.

Completion of the module

GradingGraded
Exam formatOral exam
LanguageEnglish
Duration/Extent30 min.

Duration of the module

The following number of semesters is estimated for taking and completing the module: 1 semester(s).

This module can be started in the following semesters: Winter semester.

Maximum number of participants

The maximum capacity of participants is 60.

Registration procedures

Registration for the course on ISIS. Registration for the complete module on MOSES / QISPOS / registration office.

Recommended reading, lecture notes

Lecture notes

unavailable

Electronic lecture notes

available

Recommended literature

  • Mitzenmacher, Michael. Upfal, Eli: Probability and Computing. Cambridge University Press, 2005.
  • Newman, Mark: Networks. 2nd ed. Oxford University Press, 2018 - https://global.oup.com › networks-9780198805090
  • Peleg, David: Distributed Computing - A Locality-Sensitive Approach, SIAM 2000

Assigned programs

This module is not used in any program.

Miscellaneous

Not specified