Loading...
Please wait, while we are loading the content...
Similar Documents
A debugger for flow graph based parallel applications
Content Provider | ACM Digital Library |
---|---|
Author | Hersch, Roger D. Gerlach, Sebastian Schaeli, Basile Al-Shabibi, Ali |
Abstract | Flow graphs provide an explicit description of the parallelization of an application by mapping vertices onto serial computations and edges onto message transfers. We present the design and implementation of a debugger for the flow graph based Dynamic Parallel Schedules (DPS) parallelization framework. We use the flow graph to provide both a high level and detailed picture of the current state of the application execution. We describe how reordering incoming messages enables testing for the presence of message races while debugging a parallel application. The knowledge about causal dependencies between messages enables tracking messages and computations along individual branches of the flow graph. In addition to common features such as restricting the analysis to a subset of threads or processes and attaching sequential debuggers to running processes, the proposed debugger also provides support for message alterations and for message content dependent breakpoints. |
Starting Page | 14 |
Ending Page | 20 |
Page Count | 7 |
File Format | |
ISBN | 9781595937483 |
DOI | 10.1145/1273647.1273651 |
Language | English |
Publisher | Association for Computing Machinery (ACM) |
Publisher Date | 2007-07-09 |
Publisher Place | New York |
Access Restriction | Subscribed |
Subject Keyword | Message reordering Flow graph based parallel applications Message race detection Flow graph based debugging Parallel schedules |
Content Type | Text |
Resource Type | Article |