Basic Distributed Algorithms Visual Simulations for Distributed Systems Students

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 in...

Full description

Saved in:
Bibliographic Details
Published in:IEEE Global Engineering Education Conference pp. 199 - 205
Main Authors: Richard, Alexander, Francis, Jesse, Kawash, Jalal
Format: Conference Proceeding
Language:English
Published: IEEE 21.04.2021
Subjects:
Complexity theory
Computer Science Education
Data models
Data structures
Data visualization
Distributed Algorithms
Distributed Systems
Navigation
Tools for Education
Visualization
Voting
ISSN:2165-9567
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2165-9567
DOI:10.1109/EDUCON46332.2021.9453906