Distributed Systems/Verteilte Systeme
This lecture will cover the fundamentals of distributed systems and distributed algorithms.
Selected topics are:
- architectures of distributed systems. Client-server architecture, data-flow architecture, distributed algorithms
- distributed algorithms: time and causality, group communication, selection algorithms, synchronisation
- distributed storage, replication, consistency, caching, distributed storage, distributed transactions
- fault-tolerance, fault classification, voting, Byzantine agreement
(19557)
| Typ | Vorlesung |
|---|---|
| Semester | SS13 |
| Veranstaltungsumfang | 2+2 |
| Leistungspunkte | 5 |
| Raum | SR 006 |
| Zeit | Lecture Tuesday 10-12 SR 006, Exercise class Thursday 10-12 SR 006 |
Literaturliste
Andrew S. Tanenbaum, Maarten van Steen. Distributed Systems, Principles and Paradigms. Prentice Hall 2007
Nancy A. Lynch. Distributed Algorithms, Morgan Kaufmann, 1996.
Lecture notes and materials
TBA
Exercises
There will be 5-7 exercise sheets. Exercises are marked based on presentation in the exercise classes. Each participant has to vote for assignments of which he/she can present the solution.Examination
The examination will take place on July 9, 2013, 10-12.