Algorithm visualization for distributed environments

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

[1]  Cherri M. Pancake,et al.  Models for visualization in parallel debuggers , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).

[2]  Kenneth P. Birman,et al.  Reliable communication in the presence of failures , 1987, TOCS.

[3]  David P. Dobkin,et al.  Visualization of Geometric Algorithms , 1995, IEEE Trans. Vis. Comput. Graph..

[4]  André Schiper,et al.  The Causal Ordering Abstraction and a Simple Way to Implement it , 1991, Inf. Process. Lett..

[5]  Marc H. Brown,et al.  Zeus: a system for algorithm animation and multi-view editing , 1991, Proceedings 1991 IEEE Workshop on Visual Languages.

[6]  Konrad Slind,et al.  Monitoring distributed systems , 1987, TOCS.

[7]  K Schwan,et al.  Graphical views of parallel programs , 1986, SOEN.

[8]  Thomas Bemmerl,et al.  Visualization of Message Passing Parallel Programs with the TOPSYS Parallel Programming Environment , 1993, J. Parallel Distributed Comput..

[9]  Marc Najork,et al.  Collaborative Active Textbooks: a Web-based algorithm animation system for an electronic classroom , 1996, Proceedings 1996 IEEE Symposium on Visual Languages.

[10]  Robert Sedgewick,et al.  Techniques for Algorithm Animation , 1985, IEEE Software.

[11]  Michael T. Heath,et al.  Parallel performance visualization: from practice to theory , 1995, IEEE Parallel Distributed Technol. Syst. Appl..

[12]  John T. Stasko.  Tango: A Framework and System for Algorithm Animation , 1990, Computer.

[13]  Charles E. McDowell,et al.  Debugging concurrent programs , 1989, ACM Comput. Surv..

[14]  Robert Sedgewick,et al.  SYSTEM FOR ALGORITHM ANIMATION. , 1984 .

[15]  Ayellet Tal,et al.  Visualization of geometric algorithms in an electronic classroom , 1997 .

[16]  André Schiper,et al.  A New Algorithm to Implement Causal Ordering , 1989, WDAG.

[17]  Leslie Lamport,et al.  Distributed snapshots: determining global states of distributed systems , 1985, TOCS.

[18]  Eileen Kraemer,et al.  Toward flexible control of the temporal mapping from concurrent program events to animations , 1994, Proceedings of 8th International Parallel Processing Symposium.

[19]  Eileen Kraemer,et al.  Creating an accurate portrayal of concurrent executions , 1998, IEEE Concurr..

[20]  Eileen Kraemer,et al.  A Methodology for Building Application-Specific Visualizations of Parallel Programs , 1993, J. Parallel Distributed Comput..

[21]  Gruia-Catalin Roman,et al.  Pavane: a system for declarative visualization of concurrent computations , 1992, J. Vis. Lang. Comput..

[22]  David Notkin,et al.  Voyeur: graphical views of parallel programs , 1988, PADD '88.

[23]  Giuseppe Liotta,et al.  Algorithm animation over the World Wide Web , 1996, AVI '96.

[24]  Michael T. Heath,et al.  The Visual Display of Parallel Performance Data , 1995, Computer.

[25]  Hank Jakiela,et al.  Performance Visualization of a Distributed System: A Case Study , 1995, Computer.

[26]  Eileen Kraemer,et al.  The Visualization of Parallel Systems: An Overview , 1993, J. Parallel Distributed Comput..

[27]  Robert Sedgewick,et al.  A system for algorithm animation , 1984, SIGGRAPH.

[28]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.