IN4150 Distributed algorithms

Introduction to distributed algorithms; notions of time and ordering of events; distributed algorithms for message ordering, detecting global states, termination detection, deadlock detection, mutual exclusion, election, minimum-weight spanning trees, fault tolerance, consensus, and agreement.

After having completed this course, the student has a good knowledge of and insight into important fundamental (theoretical) problems in distributed systems and their algorithmic solutions. In addition, the student can design and implement distributed algorithms that solve these problems.

Teachers

Last modified: 2023-11-03