Distributed Algorithms For Fault ToleranceFDA155, 2005HT
18h, plus invited lectures depending on availability of external guests.
PhD students with fundamental knowledge in logic, discrete mathematics and computer algorithms corresponding to the core courses in CUGS graduate school.
The course was last given
The course will give an overview of theoretical problems in distributed systems with a focus in scenarios in which fault, errors and failures appear. Students get a deeper knowledge about group communication mechanisms and consensus algorithms in fault-tolerant systems.
Undergraduate course in distributed systems recommended.
Lectures, self study sessions, and invited seminars.
The course begins with models and notions for distributed systems and goes on to study well-known algorithms for fault-tolerant broadcast, consensus and related problems, as well as replication management including group services. Finally related topics such as self-stablising systems are reviewed.
Articles, selected chapters from books by Muellender, Tel and Lynch.
Simin Nadjm-Tehrani (eight lectures) , Ulf Nilsson (one lecture)
The course will not be unless elected by at least 6 students.
Page responsible: Director of Graduate Studies
Last updated: 2012-05-03