Distributed Algorithms

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

The final grade of the course consists of the following components:

• Written Exam (weighting 100%)

• Group Assignment: lab (Pass/Fail)

The lab assignment consists in implementing key distributed algorithms. You need to pass the lab assignments to receive the final grade.

Final grade calculation = 1. 0 * Written Exam

A passing final grade for the course can only be earned when for all components at least a 5.0 is earned, and the weighted final grade is at least a 5.8.

In case of an insufficient final result, repair options may exist in accordance with Article 17A, Times and number of examinations, sub 1, of the Teaching and Examination Regulations, for:

• Written Exam: Resit opportunity

• Group Assignment: Repair opportunity

Disclaimer: information may change depending on unforeseen circumstances or measures (see: TER Art 2, sub 5).