Distributed Algorithms
Overview
| Instructor |
Prof. Dr. rer. nat. Volker Turau
|
| Tutor |
Christoph Weyer
|
| Course Format |
2
hours
lecture 2 hours exercise |
| ECTS credit points | 6.0 |
| Workload | 180 hours total |
| Performance record | Oral exam |
| Period | Winter Semester |
| Language | German |
| Stud.IP |
Lecture
Exercise |
Prerequisites
Good knowledge of distributed systems and of algorithms and data structures
Contents
- Vertex coloring
- Leader Election
- Tree Algorithms
- Independent and dominating set
- Locality Lower Bounds
- Self-stabilization
- Multi-Core Computing
Learning Outcomes
Knowledge
Deepened Knowledge in the field of distributed algorithms, standard algorithms including their complexity
Methodical Expertise
Enable students to systematically design and analyse distributed algorithms
System Expertise
System-oriented thinking focusing on principles of distributed algorithms including the mastering of complexity analysis
Reading Resources
- Intro to Distributed Algorithms. Gerard Tel, Cambridge University Press; 2. Auflage (August 2008)
- Design and Analysis of Distributed Algorithms. Nicola Santoro, John Wiley & Sons; Auflage: 1. Auflage (November 2006)