Distributed algorithms for fault-tolerance

Lectures:

20h

Recommended for

PhD students with a basic background in computer algorithms, logic and discrete mathematics.

The course was last given:

New course

Goals

The course will give an overview of distributed systems and problems appearing in distributed computations in presence of faults.

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, to be decided.

Teachers

Simin Nadjm-Tehrani, Ulf Nilsson

Examiner

Simin Nadjm-Tehrani

Schedule

Fall 2001.

Examination

Written examination, or home assignments - to be decided.

Credit

4 points.