Course ObjectiveThe 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
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.
Course ContentThe 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
Teaching Methods4 hours per week HC
4 hours per week WC
Method of AssessmentWritten 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).
LiteratureW.J. Fokkink. Distributed Algorithms: An Intuitive Approach (2nd ed).
Target AudiencemAI, mCS, mPDCS
Additional InformationThe homepage of the course is at http://www.cs.vu.nl/~tcs/da/
Recommended background knowledgeDatastructures & Algorithms
|Language of Tuition||English|
|Faculty||Faculty of Science|
|Course Coordinator||prof. dr. W.J. Fokkink|
|Examiner||prof. dr. W.J. Fokkink|
prof. dr. W.J. Fokkink
You need to register for this course yourself
Last-minute registration is available for this course.
|Teaching Methods||Seminar, Lecture|
This course is also available as: