Conference ProceedingsOPEN ACCESS

Visualization of parallel execution graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1547 403-412
DOI: 10.1007/3-540-37623-2_32
1Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Steckelbach, B., Bubeck, T., Fößmeier, U., Kaufmann, M., Ritt, M., & Rosenstiel, W. (1999). Visualization of parallel execution graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1547, pp. 403–412). Springer Verlag. https://doi.org/10.1007/3-540-37623-2_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free