Visualization of Parallel Execution Graphs

Authors:
Björn Steckelbach;Till Bubeck;Ulrich Fößmeier;Michael Kaufmann;Marcus Ritt;Wolfgang Rosenstiel
Affiliations:
-;-;-;-;-;-
Venue:
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Year:
1998

Citing 4
Cited 0

Crossing Minimization in Linear Embeddings of Graphs

IEEE Transactions on Computers
On the Complexity of Single Row Routing Problems

WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Single Row Routing

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

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.