DisASTer (distributed algorithms simulation terrain): a platform for the implementation of distributed algorithms

Authors:
Rainer Oechsle;Tim Gottwald
Affiliations:
University of Applied Sciences, Trier, Trier, Germany;University of Applied Sciences, Trier, Trier, Germany
Venue:
ITiCSE '05 Proceedings of the 10th annual SIGCSE conference on Innovation and technology in computer science education
Year:
2005

Citing 4
Cited 2

Distributed systems (3rd ed.): concepts and design

Distributed systems (3rd ed.): concepts and design
An optimal algorithm for mutual exclusion in computer networks

Communications of the ACM
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
Distributed Systems: Principles and Paradigms

Distributed Systems: Principles and Paradigms

Virtualized games for teaching about distributed systems

Proceedings of the 40th ACM technical symposium on Computer science education
JavaSpaces NetBeans: a linda workbench for distributed programming course

Proceedings of the fifteenth annual conference on Innovation and technology in computer science education

Quantified Score

Hi-index	0.00

Visualization

Abstract

DisASTer (Distributed Algorithms Simulation Terrain) is a platform for the implementation of distributed algorithms. It provides a Java class library that eases the programming of distributed algorithms in Java. Moreover, DisASTer constitutes an execution environment that enables the user to specify interactively a topology at runtime. It allows the user to control the execution of the algorithm (start, stop, suspend, resume, go back and forth). In addition, the execution of a distributed algorithm can be observed through some built-in visualization panels (topology view, sequence view, message queue view). DisASTer supports the implementation of further application-specific views.