Syllabus:

Distributed algorithms are algorithms where serveral autonomous processes cooperate to solve a common problem and where communication is by messages only. Such algorithms are typically used in distributed systems without common memory. Since no process has an up to date and consistent view of the global state, solutions to typical problems are non-trivial. The following topics will be discussed in the lecture: models for distributed computing; space-time diagrams; virtual time; logical clocks and causality; wave algorithms; distributed and parallel graph traversing; consistent snapshots; mutual exclusion; election and symmetry breaking; distributed terminiation detection; garbage collection in distributed systems; observing distributed systems; global predicates; testing and debugging of distributed systems; parallel and distributed simulation; distributed / virtual shared memory. Supplementary information (in German)

Prerequisites (necessary knowledge):

intermediate diploma (computer science)

Relevant Literature:

F. Mattern: Verteilte Basisalgorithmen. Springer-Verlag, 1989. G. Tel: Topics in Distributed Algorithms. Cambridge University Press, 1991. G. Tel: Introduction to Distributed Algorithms. Cambridge University Press, 1994. V. Barbosa: An Introduction to Distributed Algorithms, MIT Press, 1996 N. Lynch: Distributed Algorithms, Morgan Kaufmann Pub., 1996. V. K. Garg: Principles of Distributed Systems, Kluwer, 1996

Course Cycle:

sporadic

Course Language:

German