Abstract
Parallel programs usually have complex execution behavior which can be studied by visualizing their execution. The run-time visualization captures the dynamic behavior of the program which is otherwise hidden by postmortem visualization. The visualization effort for hierarchical systems such as Cedar requires parallelism to be detected at cluster and processor level simultaneously. We examine the real-time visualization methodology for shared memory multiprocessors. Two applications, visualizing the concurrent processes and matrix-related computations, are used to highlight the importance of visualization in understanding parallel program execution on shared memory multiprocessors.
Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign, 305 Talbot Laboratory, 104 South Wright St., Urbana, IL, 61801-2932. This work was supported by the National Science Foundation under Grant No NSF MIP-88-07775 and NASA Ames Research Center under Grant No. NASA NCC 2-559
Preview
Unable to display preview. Download preview PDF.
References
D. J. Kuck, E. S. Davidson, D. H. Lawrie, and A. H. Sameh, Parallel Supercomputing Today and the Cedar Approach, Science, Vol. 231, Feb. 28, 1986, pp. 967–974.
D. Gajski, D. L. Kuck, D. Lawrie, and A. Sameh, Cedar — A Large Scale Multiprocessor, Proceedings 1983 International Conference on Parallel Processing, Belaire, MI, 1983.
P. Emrath, An Operating System for the Cedar Multiprocessor, IEEE Software, Vol. 2, No. 4, 1985, pp. 30–37.
R. E. Mcgrath and Perry A. Emrath, Using Memory in the Cedar System, Proceedings 1987 Supercomputing Conference, Greece, June, 1987.
M. D. Guzzi Cedar Fortran Programming Handbook, CSRD Report No. 601, Center for Supercomputing Res. and Dev., Univ. of Illinois at Urbana-Champaign, Urbana, 1987
S. Sharma, A. D. Malony, and M. W. Berry, Run-Time Monitoring of Concurrent Programs in a Distributed Environment, Submitted for publication, 1990.
A. Malony, JED: JUST AN EVENT DISPLAY, CSRD Report No. 887, Center for Supercomputing Res. & Dev., Univ. of Illinois at Urbana-Champaign, June 1989.
M. Berry, The Use of Matrix Visualization in Algorithmic design, To appear in Computing Systems in Engineering (1990).
University of California. Unix User's Manual, Reference Guide-4.2 Berkeley Software Distribution, Computer Science Division, University of California, Berkeley, 1984.
A. L. Couch, Graphical Representations of Program Performance on Hypercube Message Passing Multiprocessors, PhD Thesis, Tufts University, Department of CS, April 1988.
D. Bernstein, A. Bolmarcich, and K. So, Performance Visualization of Parallel Programs on a Shared Memory Multiprocessor System, Proceedings of the 1989 International Conference on Parallel Processing, pp. ii-1–ii-7.
R. Scheifler and J. Gettys, The X Window System, ACM Trans. on Graphics, Vol. 5, No. 2, April, 1986, pp. 79–109.
J. McCormak, P. Asente, R. Swick, X Toolkit Intrinsics — C Language Interface, MIT, 1988.
Ralph R. Swick & Terry Weissman, X Toolkit Athena Widgets — C Language Interface, MIT, 1988.
Programming with the HP X Widgets, Hewlett-Packard, Nov. 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sharma, S. (1990). Real-time visualization of concurrent processes. In: Burkhart, H. (eds) CONPAR 90 — VAPP IV. VAPP CONPAR 1990 1990. Lecture Notes in Computer Science, vol 457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53065-7_160
Download citation
DOI: https://doi.org/10.1007/3-540-53065-7_160
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53065-7
Online ISBN: 978-3-540-46597-3
eBook Packages: Springer Book Archive