Journal of Information Processing
Space-efficient scheduling of multithreaded computations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Models and languages for parallel computation
ACM Computing Surveys (CSUR)
Graph layout for applications in compiler construction
Theoretical Computer Science
UML distilled (2nd ed.): a brief guide to the standard object modeling language
UML distilled (2nd ed.): a brief guide to the standard object modeling language
An object-oriented platform for distributed high-performance symbolic computation
Mathematics and Computers in Simulation - Special issue on high performance symbolic computing
Drawing graphs
Automatic layout of statecharts
Software—Practice & Experience
Creating an Accurate Portrayal of Concurrent Executions
IEEE Concurrency
Visualizing the Performance of Parallel Programs
IEEE Software
A Technique for Drawing Directed Graphs
IEEE Transactions on Software Engineering
ViSta: a tool suite for the visualization of behavioral requirements
Journal of Systems and Software
Upper Bounds on the Number of Hidden Nodes in Sugiyama's Algorithm
GD '96 Proceedings of the Symposium on Graph Drawing
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Fast and Simple Horizontal Coordinate Assignment
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
The Java Developer's Guide to Eclipse
The Java Developer's Guide to Eclipse
Cilk: efficient multithreaded computing
Cilk: efficient multithreaded computing
Tools for performance tuning and debugging
Sourcebook of parallel computing
Flexible layering in hierarchical drawings with nodes of arbitrary size
ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
An efficient implementation of sugiyama's algorithm for layered graph drawing
GD'04 Proceedings of the 12th international conference on Graph Drawing
A fast and simple heuristic for constrained two-level crossing reduction
GD'04 Proceedings of the 12th international conference on Graph Drawing
Hi-index | 0.00 |
This paper deals with a visualization-based approach to performance analyzing and tuning of highly irregular task-parallel applications. At its core lies a novel automatic layout algorithm for execution graphs which is based on Sugiyama's framework. Our visualization enables the application designer to reliably detect manifestations of parallel overhead and to investigate on their individual root causes. We particularly focus on structural properties of task-parallel computations which are hard to detect in a more analytical way, for example, false sharing and false parallelism. In addition, we discuss embedding our visualization into an integrated development environment, realizing a seamless work-flow for implementation, execution, analysis, and tuning of parallel progams.