Distributed algorithms visualisation for educational purposes

Authors:
Boris Koldehofe;Marina Papatriantafilou;Philippas Tsigas
Affiliations:
Computer Science Department, Saarlandes Un., 66123 Saarbrücken, Germany and Chalmers Un., 412 96 Göteborg, Sweden;Computing Science Department, Chalmers Un. of Technology and Göteborg Un., S-412 96 Göteborg, Sweden;Computing Science Department, Chalmers Un. of Technology and Göteborg Un., S-412 96 Göteborg, Sweden
Venue:
ITiCSE '99 Proceedings of the 4th annual SIGCSE/SIGCUE ITiCSE conference on Innovation and technology in computer science education
Year:
1999

Citing 9
Cited 7

The drinking philosophers problem

ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
A simple parallel algorithm for the maximal independent set problem

SIAM Journal on Computing
The periodic balanced sorting network

Journal of the ACM (JACM)
Introduction to distributed algorithms

Introduction to distributed algorithms
Efficient fault-tolerant algorithms for distributed resource allocation

ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed algorithms in Java

Proceedings of the 2nd conference on Integrating technology into computer science education
A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
An optimal algorithm for mutual exclusion in computer networks

Communications of the ACM
Distributed Algorithms

Distributed Algorithms

Growing squares: animated visualization of causal relations

Proceedings of the 2003 ACM symposium on Software visualization
Integrating a simulation-visualisation environment in a basic distributed systems course: a case study using LYDIAN

Proceedings of the 8th annual conference on Innovation and technology in computer science education
Virtual trees for the byzantine generals algorithm

Proceedings of the 35th SIGCSE technical symposium on Computer science education
Animated visualization of causal relations through growing 2D geometry

Information Visualization - Special issue: Software visualization
LYDIAN: An extensible educational animation environment for distributed algorithms

Journal on Educational Resources in Computing (JERIC)
Algon: From Interchangeable Distributed Algorithms to Interchangeable Middleware

Electronic Notes in Theoretical Computer Science (ENTCS)
Causality visualization using animated growing polygons

INFOVIS'03 Proceedings of the Ninth annual IEEE conference on Information visualization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present our work on building interactive continuous visualisations of distributed algorithms for educational purposes. The animations are comprised by a set of visualisation windows. The visualisation windows are designed so that they demonstrate i) the different behaviours of the algorithms while running in different systems, ii) the different behaviours that the algorithms exhibit under different timing and workload of the system iii) the time and space complexities of the algorithms and iv) the "key ideas" of the functionality of the algorithms. Visualisations have been written for a set of lO algorithms that are tought in a Distributed Algorithms advanced undergraduate course.