VAPP 1992, CONPAR 1992: Parallel Processing: CONPAR 92—VAPP V pp 55-66 | Cite as
Execution replay: A mechanism for integrating a visualization tool with a symbolic debugger
Abstract
Graphical representations of a program execution (also called visualization) have been shown to be useful to understand the behavior of parallel programs. Visualization of an execution is generally done off-line, using an adequate trace generated during execution. However, during the debugging phase, such representations may turn out to be insufficient: use of a symbolic debugger may also be required. The goal of this paper is to show that execution replay is the basic component that must be used to integrate a symbolic debugger with a visualization tool. Such an integration allows a simultaneous use of both tools during an execution, leading to an ideal observation of the execution: low level observation thanks to the debugger, and high level observation thanks to the visualization. This new approach has been implemented for parallel programs running on an iPSC/2.
Keywords
Parallel Program Visualization Tool Program Execution Trace Generation Trace RecordingPreview
Unable to display preview. Download preview PDF.
References
- [1]T. Bemmerl, O. Hansen, T. Ludwig, “PAT0P for Performance Tuning of Parallel Programs”, Proc. of CONPAR 90 — VAPPIV conference, Zurich, Switzerland, Sept. 1990.Google Scholar
- [2]R. Curtis, L. Wittie, “BugNet: A Debugging System for Parallel Programming Environments”, Proc. 3rd Int. Conf. on Distributed Computing Systems, Hollywood, FL, Oct. 1982.Google Scholar
- [3]M. Heath, J. Etheridge, “Visualizing the Performance of Parallel Programs”, IEEE Software, Sept. 1991.Google Scholar
- [4]J. Fowler, W. Zwaenepoel, “Causal Distributed Breakpoints”, Proc. 10th IEEE Int. Conf. on Distributed Computing Systems, Paris, May 90.Google Scholar
- [5]P. Kearns, B. Koodalattupuram, “Immediate Ordered Service in Distributed Systems”, Proc. 9th Symp. on Distributed Computer Systems, IEEE Computer Society, 1989.Google Scholar
- [6]L. Lamport, “Time, Clocks and the Ordering of Events in a Distributed System”, Communication of the ACM 21 (7), 1978.Google Scholar
- [7]L. Lamport, “How to Make a Multiprocessor Computer that Correctly Executes Multiprocess Programs”, IEEE Trans. on Computers C-28(9), Sept. 1979.Google Scholar
- [8]T. Leblanc, J. Mellor-Crummey, “Debugging Parallel Programs with Instant Replay”, IEEE Transactions on Computers C-36(4), April 1987.Google Scholar
- [9]T. Leblanc, J. Mellor-Crummey, R. Fowler, “Analysing Parallel Program Executions Using Multiple Views”, Journal of Parallel and Distributed Computing 9, 1990.Google Scholar
- [10]E. Leu, A. Schiper, A. Zramdini, “Efficient Execution Replay Technique on Distributed Memory Architectures”, Proc. of the 2nd European Distributed Memory Computing Conference, LNCS 487, Springer-Verlag, Munich, April 1991.Google Scholar
- [11]M. Raynal, A. Schiper, S. Toueg, “The causal Ordering Abstract and a Simple Way to Implement it”, Information Processing Letters 39, Sept. 1991.Google Scholar
- [12]L. Ni, K. Tai, eds, “Special Issue on Software Tools for Parallel Programming and Visualization”, Journal of Parallel and Distributed Computing, Vol. 9 No 2, June 1990.Google Scholar
- [13]D. Socha, M. Bailey, D. Notkin, “Voyeur: Graphical Views of Parallel Programs, Special Issue of SIGPLAN Notices, Vol. 24 No 1, Jan. 1989.Google Scholar
- [14]J. M. Stone, “A Graphical Representation of Concurrent Processes”, Special Issue of SIGPLAN Notices, Vol. 24 No 1, Jan. 1989.Google Scholar