Hide menu

Distributed Algorithms For Fault Tolerance

FDA155, 2005HT

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

  Log in  




Course plan

Lectures

18h, plus invited lectures depending on availability of external guests.

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

Autumn 2003

Goals

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.

Prerequisites

Undergraduate course in distributed systems recommended.

Contents

Lectures, self study sessions, and invited seminars.

Organization

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.

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.

Organized by

Comments

The course will not be unless elected by at least 6 students.


Page responsible: Webmaster
Last updated: 2012-05-03