Distributed Algorithms

2018-2019
Dit vak wordt in het Engels aangeboden. Omschrijvingen kunnen daardoor mogelijk alleen in het Engels worden weergegeven.

Doel vak

The main objective is to provide students with an algorithmic frame of
mind for solving fundamental problems in distributed computing. They
obtain insight into concurrency concepts, and are offered a bird's-eye
view on a wide range of algorithms for basic and important challenges in
distributed systems.

Characteristic of the course is that correctness arguments and
complexity calculations of distributed algorithms are provided in an
intuitive fashion and by means of examples and exercises.

Inhoud vak

The following topics are treated in the course: Logical clocks,
snapshots, graph traversal, termination detection, garbage collection,
deadlock detection, routing, election, minimal spanning trees, anonymous
networks, checkpointing, fault tolerance, failure detection, consensus,
mutual exclusion, self-stabilization, blockchains, database transactions

Onderwijsvorm

4 hours per week HC
4 hours per week WC

Toetsvorm

Written examen (plus a take-home exercise sheet that can provide up to
0.5 bonus point, if a passing mark for the written exam is achieved).

Literatuur

W.J. Fokkink. Distributed Algorithms: An Intuitive Approach (2nd ed).
MIT Press,
2018.

Doelgroep

mAI, mCS, mPDCS

Overige informatie

The homepage of the course is at http://www.cs.vu.nl/~tcs/da/

Aanbevolen voorkennis

Datastructures & Algorithms

Algemene informatie

Vakcode X_400211
Studiepunten 6 EC
Periode P5
Vakniveau 500
Onderwijstaal Engels
Faculteit Faculteit der Bètawetenschappen
Vakcoördinator prof. dr. W.J. Fokkink
Examinator prof. dr. W.J. Fokkink
Docenten prof. dr. W.J. Fokkink
J. Urbani

Praktische informatie

Voor dit vak moet je zelf intekenen.

Voor dit vak kun je last-minute intekenen.

Werkvormen Werkcollege, Hoorcollege
Doelgroepen

Dit vak is ook toegankelijk als: