An introductory course on distributed systems typically exposes students to some basic synchronization distributed algorithms. This is often the first exposure for these students to the topic of distributed algorithms. In addition, in a systems course, these algorithms are typically covered in an informal way, avoiding proofs of correctness or complexity analysis. Hence, this first exposure can be challenging to students. Visualization of these algorithms can help alleviate some of these challenges. We present a suite to visualize six basic algorithms on total ordering, critical sections, and leader election. This suite is developed by two undergraduate students.
A description of each of these algorithms can be found in this paper.
✓ Totally Ordered Broadcast Algorithm (By Alexander Richard)
✓ Timestamps Distributed Critical Section Algorithm (By Alexander Richard)
✓ Token-Ring Distributed Critical Section Algorithm (By Jesse Francis)
✓ Leader-based Distributed Critical Section Algorithm (By Jesse Francis)
✓ O(n2) Ring Leader Election Algorithm (By Alexander Richard)
✓ Bully Leader Election Algorithm (By Alexander Richard)
[HOME]