Distributed Algorithms For Fault-ToleranceFDA155, 2003HT
No of lectures
18h, Seminars: 6h.
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
New CUGS course.
The course will give an overview of distributed systems and a deeper knowledge about solutions to problems that appear in distributed computations in presence of failures.
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. Other related topics such as self-stablising systems are also 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 more than 6 students.
Page responsible: Director of Graduate Studies
Last updated: 2012-05-03