Hide menu

Distributed Algorithms For Fault-Tolerance

FDA155, 2003HT

Status Archive
School National Graduate School in Computer Science (CUGS)
Division SAS
Owner Simin Nadjm-Tehrani
Homepage http://www.ida.liu.se/~snt/teaching/Distalg

If you would like to register for this course, please
contact Anne Moe, annes@ida.liu.se

  Log in  




Course plan

No of lectures

18h, Seminars: 6h.

Recommended for

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.

Goals

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.

Prerequisites

Undergraduate course in distributed systems recommended.

Organization

Lectures, self study sessions, and invited seminars.

Contents

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.

Literature

Articles, selected chapters from books by Muellender, Tel and Lynch.

Lecturers

Simin Nadjm-Tehrani (eight lectures) , Ulf Nilsson (one lecture)

Examiner

Simin Nadjm-Tehrani.

Examination

Home assignments.

Credit

3 credits.

Comments

The course will not be unless elected by more than 6 students.


Page responsible: Director of Graduate Studies
Last updated: 2012-05-03