MOVIS: A system for visualizing distributed mobile object environments

Journal of Visual Languages and Computing

Volumn 19, Issue 3, 2008, Pages 303-320

  Frishman, Yaniv ^a   Tal, Ayellet ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Distributed software visualization; Dynamic graph layout; Mobile objects

Indexed keywords

EID: 42949140881     PISSN: 1045926X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jvlc.2007.07.006     Document Type: Article

References (53)

1. Object Management Group. The Common Object Request Broker: Architecture and Specification. Revision 2.2, February 1998.
2. A. Acharya, M. Ranganathan, J. Saltz, Sumatra: a language for resource-aware mobile programs, in: Mobile Object Systems: Towards the Programmable Internet, in: Lecture Notes in Computer Science, vol. 1222, Springer, Berlin, 1996, pp. 111-130.
3. Holder O., Ben-Shaul I., and Gazit H. Dynamic layout of distributed applications in fargo. Proceedings of the International Conference on Software Engineering (1999) 163-173
4. In: Milojicic D., Douglis F., and Wheeler R. (Eds). Mobility: Processes, Computers and Agents (1999), ACM, New York
5. Holder O., Ben-Shaul I., and Gazit H. System support for dynamic layout of distributed applications. Conference on Distributed Computing Systems (ICDCS'99) (1999) 403-411
6. ObjectSpace. ObjectSpace Voyager Core Package: Technical Overview, December 1997.
7. Y. Wang, T. Kunz, Visualizing mobile agent executions, in: Workshop on Mobile Agents for Telecommunication Applications (MATA 2000), in: Lecture Notes in Computer Science, vol. 1931, Springer, Berlin, 2000, pp. 103-114.
8. Wong A., Dillon T., Ip M., and Lin W. A generic visualization framework to help debug mobile-object-based distributed programs running on large networks. WORDS, IEEE Computer Society (2001) 240-250
9. Frishman Y., and Tal A. Dynamic drawing of clustered graphs. Proceedings of the IEEE Symposium on Information Visualization, InfoVis (2004) 191-198
10. Frishman Y., and Tal A. Visualization of mobile object environments. ACM Symposium on Software Visualization (2005) 145-154
11. Kraemer E., and Stasko J.T. The visualization of parallel systems: an overview. Journal of Parallel and Distributed Computing 18 2 (1993) 105-117
12. Topol B., Stasko J.T., and Sunderam V. Pvanim: a tool for visualization in network computing environments. Concurrency: Practice and Experience 10 14 (1998) 1197-1222
13. Stasko J.T., and Kraemer E. A methodology for building application-specific visualizations of parallel programs. Journal of Parallel and Distributed Computing 18 2 (1993) 258-264
14. Moe J., and Carr D.A. Understanding distributed systems via execution trace data. International Workshop on Program Comprehension (2001) 60-69
15. Moses Y., Polunsky Z., Tal A., and Ulitsky L. Algorithm visualization for distributed environments. Journal of Visual Languages and Computing 15 1 (2004) 97-123
16. Reed D.A., Aydt R.A., Noe R.J., Roth P.C., Shields K.A., Schwartz B.W., and Tavera L.F. Scalable performance analysis: the pablo performance analysis environment. Proceedings of the Scalable Parallel Libraries Conference (1993) 104-113
17. W. De Pauw, E. Jensen, N. Mitchell, G. Sevitsky, J. Vlissides, J. Yang, Visualizing the execution of java programs, in: Proceedings of the International Seminar on Software Visualization, in: Lecture Notes in Computer Science, vol. 2269, Springer, Berlin, 2001, pp. 151-162.
18. Kohl J.A., and Geist G.A. The PVM 3.4 tracing facility and XPVM 1.1. Proceedings of the Hawaii International Conference on System Sciences vol. 1 (1996) 290-299
19. Di Battista G., Eades P., Tamassia R., and Tollis I.G. Algorithms for drawing graphs: an annotated bibliography. Computational Geometry: Theory and Applications 4 5 (1994) 235-282
20. M. Kaufmann, D. Wagner (Eds.), Drawing Graphs: Methods and Models, in: Lecture Notes in Computer Science, vol. 2025, Springer, Berlin, 2001.
21. Tollis I.G., Di Battista G., Eades P., and Tamassia R. Graph Drawing: Algorithms for the Visualization of Graphs (1999), Prentice-Hall, Englewood Cliffs, NJ
22. Kamada T., and Kawai S. An algorithm for drawing general undirected graphs. Information Processing Letters 31 1 (1989) 7-15
23. J.H. Chuang, C.C. Lin, H.C. Yen, Drawing graphs with nonuniform nodes using potential fields, in: Proceedings of the Graph Drawing (GD'03), in: Lecture Notes in Computer Science, vol. 2912, Springer, Berlin, 2004, pp. 460-465.
24. E.R. Gansner, S.C. North, Improved force-directed layouts, in: Proceedings of the 6th International Symposium on Graph Drawing (GD 1998), in: Lecture Notes in Computer Science, vol. 1547, Springer, Berlin, 1998, pp. 364-373.
25. D. Harel, Y. Koren, Drawing graphs with non-uniform vertices, in: Proceedings of the Working Conference on Advanced Visual Interfaces (AVI'02), ACM, New York, 2002, pp. 157-166.
26. S. Hachul, M. Jünger, Drawing large graphs with a potential-field-based multilevel algorithm, Graph Drawing (2004) 285-295.
27. Harel D., and Koren Y. A fast multi-scale algorithm for drawing large graphs. Journal of Graph Algorithms Applications 6 3 (2002) 179-202
28. Koren Y., Carmel L., and Harel D. Drawing huge graphs by algebraic multigrid optimization. Multiscale Modeling & Simulation 1 4 (2003) 645-673
29. Walshaw C. A multilevel algorithm for force-directed graph drawing. Journal of Graph Algorithms and Applications 7 3 (2003) 253-285
30. X. Wang, I. Miyamoto, Generating customized layouts, in: Proceedings of the 3rd International Symposium on Graph Drawing (GD 1995), in: Lecture Notes in Computer Science, vol. 1027, Springer, Berlin, 1996, pp. 504-515.
31. P. Eades, Q.W. Feng, Multilevel visualization of clustered graphs, in: Proceedings of the 4th International Symposium on Graph Drawing (GD 1996), in: Lecture Notes in Computer Science, vol. 1190, Springer, Berlin, 1996, pp. 101-112.
32. F. Bertault, M. Miller, An algorithm for drawing compound graphs, in: Proceedings of the 7th International Symposium on Graph Drawing (GD 1999), in: Lecture Notes in Computer Science, vol. 1731, Springer, Berlin, 2000, pp. 197-204.
33. S. Diehl, C. Gorg, Graphs, they are changing-dynamic graph drawing for a sequence of graphs, in: Proceedings of the Graph Drawing (GD'02), in: Lecture Notes in Computer Science, vol. 2528, Springer, Berlin, 2002, pp. 23-31.
34. S.C. North, Incremental layout in dynadag, in: Proceedings of the 3rd International Symposium on Graph Drawing (GD 1995), in: Lecture Notes in Computer Science, vol. 1027, Springer, Berlin, 1995, pp. 409-418.
35. Misue K., Eades P., Lai W., and Sugiyama K. Layout adjustment and the mental map. Journal of Visual Languages and Computing 6 2 (1995) 183-210
36. G. Kumar, M. Garland, Visual exploration of complex time-varying graphs, IEEE Transactions on Visualization and Computer Graphics, in: Proceedings of the InfoVis, 2006.
37. Erten C., Harding P.J., Kobourov S.G., Wampler K., and Yee G.V. GraphAEL: graph animations with evolving layouts. Proceedings of the Graph Drawing (GD'03) (2003) 98-110
38. Brandes U., Fleischer D., and Puppe T. Dynamic spectral layout of small worlds. Proceedings of the 13th International Symposium on Graph Drawing, GD (2005) 25-36
39. Lee Y.-Y., Lin C.-C., and Yen H.-C. Mental map preserving graph drawing using simulated annealing. Conferences in Research and Practice in Information Technology vol. 60 (2006)
40. C. Görg, P. Birke, M. Pohl, S. Diehl, Dynamic graph drawing of sequences of orthogonal and hierarchical graphs, in: Proceedings of the Graph Drawing (GD'04), in: Lecture Notes in Computer Science, vol. 3383, 2004, pp. 228-238.
41. M.L. Huang, P. Eades, A fully animated interactive system for clustering and navigating huge graphs, in: Proceedings of the Graph Drawing (GD'98), in: Lecture Notes in Computer Science, vol. 1547, Springer, Berlin, 1998, pp. 374-383.
42. Lyons K.A., Meijer H., and Rappaport D. Algorithms for cluster busting in anchored graph drawing. Journal of Graph Algorithms and Applications 2 1 (1998) 1-24
43. Tom Sawyer graph layout toolkit, 2004. Currently Available at 〈http://www.tomsawyer.com/〉.
44. R. Wiese, M. Eiglsperger, M. Kaufmann, yfiles: Visualization and automatic layout of graphs, in: Proceedings of the Graph Drawing (GD'01), in: Lecture Notes in Computer Science, vol. 2265, Springer, Berlin, 2001, pp. 453-454.
45. Elmqvist N., and Tsigas P. Growing squares: animated visualization of causal relations. Proceedings of the ACM Symposium on Software Visualization (2003) 17-26
46. Lamport L. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM (1978) 558-565
47. In: Card S.K., Mackinlay J.D., and Shneiderman B. (Eds). Readings in Information Visualization Using Vision to Think (1999), Morgan Kaufman, Los Altos, CA
48. G.W. Furnas, Generalized fisheye views, in: Human Factors in Computing Systems, CHI'86 Conference Proceedings, 1986, pp. 16-23.
49. Bridgeman S.S., and Tamassia R. A user study in similarity measures for graph drawing. Journal of Graph Algorithms and Applications 6 3 (2002) 225-254
50. Collberg C., Kobourov S., Nagra J., Pitts J., and Wampler K. A system for graph-based visualization of the evolution of software. Proceedings of the ACM Symposium on Software Visualization (2003) 77-86
51. Kraemer E., and Stasko J.T. Creating an accurate portrayal of concurrent executions. IEEE Concurrency 6 1 (1998) 36-46
52. A. Joseph, R. Dar, Y. Almog, Active Market Project Report, 2000. Available from: 〈http://tochna.technion.ac.il/project/amarket/html/home.htm/〉.
53. Bercovici S., Frishman Y., Keidar I., and Tal A. Decentralized electronic mail, International Workshop on Dynamic Distributed Systems (IWDDS) (2006)