Visualization of Parallel Execution Graphs

Steckelbach, Björn and Bubeck, Till and Fößmeier, Ulrich and Kaufmann, Michael and Ritt, Marcus and Rosenstiel, Wolfgang (1998) Visualization of Parallel Execution Graphs. In: Graph Drawing 6th International Symposium, GD’ 98 , August 13-15, 1998, Montréal, Canada , pp. 403-412 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_32).

Full text not available from this repository.

Abstract

Measuring and evaluating the runtime of parallel programs is a difficult task. In this paper we present tools for performance evaluation and visualization in the distributed thread system (DTS), a programming environment for portable parallel applications. We describe the visualization of a parallel trace log as an execution graph using a novel layout algorithm which has been tailored to expose the structure of multithreaded applications.

Item Type:Conference Paper
Additional Information:10.1007/3-540-37623-2_32
Classifications:S Software and Systems > S.120 Visualization
ID Code:414

Repository Staff Only: item control page

References

T. Bubeck Eine Systemumgebung zum verteilten funktionalen Rechnen. Technical Report WSI-93-8, Eberhard-Karls-Universität Tübingen, August 1993.

T. Bubeck. Distributewd Threads System DTS User's Guide. SFB 382/C6, Universität Tübingen, Sep. 1995.

T. Bubeck, J. Schreiner, and W. Rosenstiel. Timing multi-threaded Message-Passing Programs. In C. Héritier, editor, SIPAR Workshop '96, pages 15-18, University of Geneva, Oct 1996.

A. Dingle and H. Sudborough. The complexity of single row routing problems. vol. 382 of LNCS, pages 529-540, 1989.

Farrow, Kennedy, and Zucconi. Graph grammars and global data flow analysis. pages 42-56, 1976.

M.R. Garey and D.S. Johnson. Computers and Itractability: A Guide to hte theory of NP-Completeness. W.H. Freeman and company, NY, 1979.

M. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academ. Press, 1980.

S. Masuda, K. Nakajima, T. Kashiwabara, and T. Fujisawa. Crossing minimization in linear embeddings of graphs. IEEE Transactions on CAD, 39:124-127, 1990.

R. Raghavan and S. Sahni. Single row routing. IEEE Transactions on Computers, C-32:209-220, 1983.

T. Tarng, M. Marek-Sadowska, and E. Kuh. An efficient single row routing algorithm. IEEE Transactions on CAD, 3:178-183, 1984.