Course: Vorlesung Verteilte Algorithmen (6605-551)

Persons:

• Kurt Rothermel (verantwortlich)

Type of Course:

lecture

In-Class Hours Per Week:

4

Contents:

1. Group communication,
2. Consensus,
3. Fault tolerant services,
4. Wave algorithms,
5. Termination,
6. Garbage collection,
7. Election,
8. Deadlocks,
9. Organisational & Introduction

Literature:

- J.L. Welch, H. Attiya, Distributed Computing: Fundamentals, Simulations and Advanced Topics, 1997,The event is based on a collection of scientific papers, which will be announced in the lecture.

Location:

Hohenheim

Module:

• 6605-550 Distributed Systems II (compulsory)