Valid from: Spring 2013
Decided by: FN1/Anders Gustafsson
Date of establishment: 2013-08-13
Division: Computer Science (LTH)
Course type: Third-cycle course
Teaching language: English
The course provides students with the basic knowledge to understand, analyze and design distributed algorithms. The knowledge is intended to be useful to a wide variety of research topics from the theory of distributed algorithms to protocol design, e.g. broadcasting protocols for discovery purposes in ad-hoc networks.
Knowledge and Understanding
For a passing grade the doctoral student must ... have knowledge about the basic underpinnings of distributed algorithms and the fundamental abstractions used to create them, as well as an overview of consensus, broadcast, and shared memory.
Competences and Skills
For a passing grade the doctoral student must ... have demonstrated an understanding of the foundations of distributed algorithms and programming, as well as the ability to relate selected topics in that area to others.
Judgement and Approach
For a passing grade the doctoral student must ... have demonstrated the ability to reflect the material the course is based on and to prepare a significant portion of it for presentation to peers.
The course topics include: models of distributed algorithms, fault tolerance abstractions and failure detectors, reliable broadcast, causal broadcast, shared memory, consensus, atomic broadcast, byzantine fault tolerance, virtual synchrony.
Cachin, C., Guerraoui, R. & Luis Rodrigues,: Introduction to Reliable and Secure Distributed Programming. Springer, 2011. ISBN 3642152597.
Types of instruction: Lectures, seminars, self-study literature review
Examination format: Seminars given by participants
Grading scale: Failed, pass
Course coordinator: Jörn Janneck <email@example.com>