Technische Universität Ilmenau

Distributed Systems - Interaktive Studienpläne der TU Ilmenau

Die Interaktiven Studienpläne sind ein Informationsangebot zu den Studiengängen der TU Ilmenau.

Die rechtsverbindlichen Studienpläne entnehmen Sie bitte den jeweiligen Studien- und Prüfungsordnungen (Anlage Studienplan).

Alle Angaben zu geplanten Lehrveranstaltungen finden Sie im elektronischen Vorlesungsverzeichnis.

Bitte beachten Sie, dass auf dieser Seite keine Aktualisierungen mehr vorgenommen werden. Alle Module und Studienpläne ab der PO-Version 2021 (Bachelor- und Master-Studiengänge) sind ab sofort im Campus-Portal erreichbar.

Modulinformationen zu Distributed Systems im Studiengang Master Research in Computer and Systems Engineering 2016
Modulnummer201172
Prüfungsnummer2200869
FakultätFakultät für Informatik und Automatisierung
Fachgebietsnummer 2255 (Verteilte Systeme und Betriebssysteme)
Modulverantwortliche(r)Prof. Dr. Boris Koldehofe
TurnusSommersemester
SpracheEnglisch
Leistungspunkte5
Präsenzstudium (h)45
Selbststudium (h)105
VerpflichtungWahlmodul
Abschlussmündliche Prüfungsleistung, 30 Minuten
Details zum Abschluss
Link zum Moodle-Kurs https://moodle.tu-ilmenau.de/course/view.php?id=2736
LehrendeProf. Koldehofe
Anmeldemodalitäten für alternative PL oder SL
max. Teilnehmerzahl
Vorkenntnisse

Pre-Knowledge on fundamental aspects in computing science obtained for instance in a BSc-Program computing science, in particular
-        Data structures and algorithms, Complexity Analysis
-        Basic concepts of Programming Languages
-        Basic knowledge on Computer Networks, Computer Architecture or Operating System Principles

Lernergebnisse und erworbene Kompetenzen

At the end of the course, the students can independently reproduce, explain, and relate central problems and approaches of distributed systems and corresponding algorithms.
They show a deep understanding and a broad knowledge of fundamental distributed algorithms and programming paradigms that enable them to explain their properties and to demonstrate, analyze, and prove their behavior taking various criteria into account.
Their detailed knowledge allows the students to interpret models and abstractions of distributed systems. They can self-dependently select  appropriate mechanisms to deal with communication delays and failures. The student can compare the suitability of algorithms for specific distributed systems scenarios.
They can explain the limitations of distributed systems concepts for different system properties, e.g., for synchronous and asynchronous systems or in the context of different failure models.
The students can relate findings of distributed systems principles to applicable and exemplary knowledge of current developments, e.g., blockchains, in-network computing, or data management.

Inhalt

Distributed systems: definition, classes, architecture
Models and abstractions for correctness, time and failures in distributed systems
Basic distributed systems services: IPC, Naming, Clocks
Reasoning about state in distributed systems: global state
Coordination problems and distributed algorithms: transaction processing, replication
Fundamental distributed algorithms: reliable broadcast, consensus

Medienformen und technische Anforderungen bei Lehr- und Abschlussleistungen in elektronischer Form

Slides
Lecture Recording
Exercise Assignments & Solutions
Quizzes
Blackboard Discussion

Literatur

G. F. Coulouris, J. Dillimore, T. Kindberg. Distributed Systems: Concepts And Design. 5th Ed. 2017. ISBN 978-9332575226.
M. van Steen, A. S. Tanenbaum. Distributed Systems. Ed. 3.01. 2017. ISBN 978-1543057386.  
P. Bernstein, V. Hadzilacos, N. Goodman. Concurrency Control and Recovery in Database Systems. Ed. 4.3. 1987. ISBN 0-201-10715-5.  
C. Cachin, V. Hadzilacos, N. Goodman. Introduction to Reliable and Secure Distributed Programming. Ed. 2. 2011. ISBN 978-3-642-15259-7.  
K. Birman. Reliable Distributed Systems: Technologies, Web Services, and Applications. Ed. 1. 2006. ISBN 9780387276014.

Lehrevaluation