Algorithm visualization for distributed environments

Yoram Moses, Zvi Polunsky, Ayellet Tal, Leonid Ulitsky

Research output: Contribution to journalArticlepeer-review

Abstract

This paper investigates the visualization of distributed algorithms. We present a conceptual model and a system, VADE, that realizes this model. Since in asynchronous distributed systems there is no way of knowing (let alone, visualizing) the "real" execution, we show how to generate a visualization which is consistent with the execution of the distributed algorithm. We also present the design and implementation of our system. VADE is designed so that the algorithm runs on the server's machines while the visualization is executed on a web page on the client's machine. Programmers can write animations quickly and easily with the assistance of VADE's libraries. End-users can experiment with the animation and change its visual properties.

Original languageEnglish
Pages (from-to)97-123
Number of pages27
JournalJournal of Visual Languages and Computing
Volume15
Issue number1
DOIs
StatePublished - Feb 2004

Keywords

  • Algorithm animation
  • Algorithm visualization
  • Distributed algorithms

ASJC Scopus subject areas

  • Language and Linguistics
  • Human-Computer Interaction
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Algorithm visualization for distributed environments'. Together they form a unique fingerprint.

Cite this