htw saar Piktogramm
Back to Main Page

Choose Module Version:


Distributed Algorithms and Applications

Module name (EN): Distributed Algorithms and Applications
Degree programme: Computer Science and Communication Systems, Master, ASPO 01.10.2017
Module code: KIM-VAA
Hours per semester week / Teaching method: 1V+3P (4 hours per week)
ECTS credits: 6
Semester: 1
Mandatory course: yes
Language of instruction:
Written exam

[updated 20.12.2017]
Applicability / Curricular relevance:
KIM-VAA Computer Science and Communication Systems, Master, ASPO 01.10.2017, semester 1, mandatory course
PIM-VAA Applied Informatics, Master, ASPO 01.10.2017, semester 1, optional course, informatics specific
60 class hours (= 45 clock hours) over a 15-week period.
The total student study time is 180 hours (equivalent to 6 ECTS credits).
There are therefore 135 hours available for class preparation and follow-up work and exam preparation.
Recommended prerequisites (modules):
Recommended as prerequisite for:
KIM-SWKS Software Development for Communication Systems

[updated 13.10.2016]
Module coordinator:
Prof. Dr. Markus Esch
Prof. Dr. Markus Esch
Moritz Fey, M.Sc.

[updated 26.09.2020]
Learning outcomes:
After successfully completing this module, students will be able to name the basic properties of distributed algorithms and applications and to describe common models for describing distributed systems. They will be able to explain the challenges and requirements implied by the distribution aspect in the development of distributed algorithms.
Students will be able to evaluate and implement essential aspects of distributed algorithms and applications, such as causal dependency, logical time, synchronization, etc... They will be able to transfer and apply the theoretical knowledge taught in the lecture, in order to solve actual problems. In addition, students will be able to provide simple proof for the correctness of distributed algorithms.

[updated 24.02.2018]
Module content:
- Broadcast and propagation with feedback
- Causal dependency
- Correctness properties safety and liveness
- Models for logical time
- Scheduling
- Consistent snapshot
- Deadlock, detection and avoidance
- Mutual exclusion
- Discussion of relevant practical contributions

[updated 20.12.2017]
Teaching methods/Media:
Lecture slides, annotated lecture slides as a script, lecture-related practical exercises, research on current topics

[updated 20.12.2017]
Recommended or required reading:
A. S. TANNENBAUM, M. v. STEEN: Distributed Systems. Principles and Paradigms, CreateSpace Independent Publishing Platform, 2nd Edition, 2016
G. COULOURIS, J. DOLLIMORE, T. KINDBERG: Distributed Systems: Concepts and Design, 5th Edition, 2011
G. TEL: Introduction to distributed algorithms, Cambridge University Press; 2nd Edition, 2000

[updated 20.12.2017]
Module offered in:
WS 2021/22, WS 2020/21, WS 2019/20, WS 2018/19, WS 2017/18
[Sat Oct 16 23:31:23 CEST 2021, CKEY=kvaua, BKEY=kim2, CID=KIM-VAA, LANGUAGE=en, DATE=16.10.2021]