Distributed AlgorithmsModule description #40415 / Version 1
- 6 CP
- Oral exam
- Graded
- Winter semester
- English
This module description is not valid in the current semester (Winter semester 2026/27).
| Module / Version | #40415 / #1 |
|---|---|
| Validity | SS 2014 – SS 2014 |
| Available language(s) | English |
| Credit points | 6 |
| Person responsible for the module | Heiß, Hans-Ulrich |
| Grading | Graded |
| Exam format | Oral exam |
| Language(s) of instruction | English |
Affiliation
| Faculty | Fakultät IV |
|---|---|
| Institute | Institut für Telekommunikationssysteme |
| Academic chair | 34332300 FG Open Distributed Systems (ODS) |
Contact
| Office | HFT 3 |
|---|---|
| Contact person | Le Phuoc, Danh |
| E-mail address | lehre@ods.tu-berlin.de |
| Website | http://www.ods.tu-berlin.de |
Learning outcomes
Students who have successfully finished this module know the most important basic algorithms for distributed systems and their respective properties. They know typical structures of distributed algorithms and can evaluate the complexity, scalability and fault tolerance properties. The students can apply their knowledge for selecting appropriate algorithms while designing distributed systems.
The course is principally designed to impart:
technical skills 50%, method skills 30%, system skills 10%, social skills 10%.
The course is principally designed to impart:
technical skills 50%, method skills 30%, system skills 10%, social skills 10%.
Content
* Models for distributed systems
* Flooding, echo, broadcast
* Selection
* Distributed termination detection
* Mutual exclusion
* Distributed garbage collection
* Logical clocks, vector clocks, clock synchronization
* Distributed snapshots
* Fault tolerance basics
* Consensus
* Replication
* Distributed memory
* Concurrency control
* Distributed transactions
* Flooding, echo, broadcast
* Selection
* Distributed termination detection
* Mutual exclusion
* Distributed garbage collection
* Logical clocks, vector clocks, clock synchronization
* Distributed snapshots
* Fault tolerance basics
* Consensus
* Replication
* Distributed memory
* Concurrency control
* Distributed transactions
Module components
Compulsory area
The following courses are mandatory for this module:
Workload and credit points
Distributed Algorithms (Lecture)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Preparation and follow-up | 15 | 2 h | 30 h |
| Presence | 15 | 2 h | 30 h |
| 60 h | |||
Distributed Algorithms (Exercise)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Assignments | 1 | 60 h | 60 h |
| Presence | 15 | 2 h | 30 h |
| 90 h | |||
Course-independent workload
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Exam preparation | 1 | 30 h | 30 h |
| 30 h | |||
The workload of the module adds up to 180 hours. The module therefore comprises 6 credit points.
Description of teaching and learning methods
The lecture conveys the material in traditional form. The tutorial encompasses interactive discussion of issues related to the lecture material. Students may present results of their assignments (homework).
Requirements for participation and examination
Desirable prerequisites for participation in the courses:
Basic skills in distributed systems.
Mandatory requirements for the module examination registration:
This module has no examination requirements.
Completion of the module
| Grading | Graded |
|---|---|
| Exam format | Oral exam |
| Language | English |
Exam description
Oral examination. Successful completion of assignments is a prerequisite.
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
This module is not limited to a number of students.
Registration procedures
See http://www.kbs.tu-berlin.de
Recommended reading, lecture notes
Lecture notes
unavailable
Electronic lecture notes
available – http://www.kbs.tu-berlin.de/
Recommended literature
- F. Mattern. Verteilte Basisalgorithmen. Springer-Verlag, 1989
- G. Coulouris, J. Dollimore, and T. Kindberg. Distributed Systems: Concepts and Design. Addison-Wesley, 4th edition, 2005. [auch in Deutsch erhältlich].
- G. Tel. Introduction to Distributed Algorithms. Cambridge University Press, 2nd edition, 2000.
- H. Attya, J. Welch: Distributed Computing. John Wiley, 2004
- N. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.
- S. Mullender, editor. Distributed Systems. Addison-Wesley, 2nd edition, 1993
- S. Tanenbaum and M. van Steen. Distributed Systems: Principles and Paradigms. 2nd ed., Pearson, 2007. [auch in Deutsch erhältlich].
Assigned programs
This module is not used in any program.
Miscellaneous
This module is offered every year.