A mechanism for efficient debugging of parallel programs
Barton P. Miller, Jong-Deok Choi · ACM SIGPLAN Notices · 1988
This paper addresses the design and implementation of an integrated debugging system for parallel programs running on shared memory multi-processors (SMMP). We describe the use of flowback analysis to provide information on causal relationships between events in a program's execution without re-executing the program for debugging. We introduce a mechanism called incremental tracing that, by using semantic analyses of the debugged program, makes the flowback analysis practical with only a small amount of trace generated during execution. We extend flowback analysis to apply to parallel programs and describe a method to detect race conditions in the interactions of the co-operating processes.
Cited by 139 works. doi:10.1145/960116.54004 Open-access PDF
Authors
References
- Time, clocks, and the ordering of events in a distributed system
- Notes on data base operating systems
- Guarded commands, nondeterminacy and formal derivation of programs
- Program Slicing
- The program dependence graph and its use in optimization
- The distributed V kernel and its performance for diskless workstations
- - Theory and applications
- Programmers use slices when debugging
- On the Number of Operations Simultaneously Executable in Fortran-Like Programs and Their Resulting Speedup
- Debugging Parallel Programs with Instant Replay