Document Actions
Formal Techniques for Networked and Distributed Systems
Distributed systems, e.g. networks, are one of the most occurring subject in modern computer science. Every computer scientist should know this subject, especially the specific problematic of the underlying algorithms. The complexity of these algorithm makes a correct-development and analysis of them a time consuming task. Therefore, a computer scientist has to be familiar with the basic algorithm, including their history of development, in order to have a chance to develop new distributed algorithm in relative short time.
The goal of the lecture is to present and to understand the most important distributed algorithms, including the fault tolerant ones, i.e. those that remains `correct' even if some hardware faults occur.
Keywords: Algorithms for Leader Election, Distributed Search, Spanning Tree, and Distributed Consensus.
Slides and Exercises: see left or right. - Instructors: Dr Harald Fecher
- Times & Locations: Mon, 14:15 - 15:45, HS 02-017 Geb 052 | Don, 14:15 - 15:45, HS 02-017 Geb 052
- Tutors: Matthias Heizmann
- Times & Locations of tutorials: Mon 27.10, | Thu 6.11, | Mon 17.11, | to be continued