Parallel program debugging with on-the-fly anomaly detection
Robert Hood,Ken Kennedy,John Mellor-Crummey +2 more
- 01 Oct 1990
- pp 74-81
72
TL;DR: An approach for parallel debugging that coordinates static analysis with efficient on-the-fly access anomaly detection is described, and ongoing efforts to incorporate the proposed debugging approach in the ParaScope environment are described.
read more
Abstract: We describe an approach for parallel debugging that coordinates static analysis with efficient on-the-fly access anomaly detection. We are developing on-the-fly instrumentation mechanisms for the structured synchronization primitives of Parallel Computing Forum (PCF) Fortran, the emerging standard for parallel Fortran. For programs without nested parallelism, it is possible to bound the cost of detection to a small constant at each shared access and thread creation point—in preliminary experiments this overhead is less than 40%. Our instrumentation techniques guarantee that we can isolate schedule-dependent behavior in a schedule-independent fashion. The result is that a single instrumented execution will either report sources of schedule-dependent behavior, or it will validate that all executions of the program on the same data compute the same result. When an instrumented execution is being used solely to find sources of schedule-dependent behavior, its cost can be reduced by slicing out computations that do not contribute to race conditions. Our approach to debugging is particularly well-suited for inclusion in a parallel program development environment; we describe our ongoing efforts to incorporate it in the ParaScope environment.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Memory consistency models for shared-memory multiprocessors
Kourosh Gharachorloo
- 01 Dec 1995
TL;DR: The results show that the optimizations enabled by relaxed models are extremely effective in hiding virtually the full latency of writes in architectures with blocking reads, with gains as high as 80%.
Detecting data races on weak memory systems
Sarita V. Adve,Mark D. Hill,Barton P. Miller,Robert H. B. Netzer +3 more
- 01 Apr 1991
TL;DR: This paper investigates the extension of dynamic data race detection techniques developed for sequentially consistent systems to weak systems and formalizes this condition and shows that it allows data races to be dynamically detected.
Efficient on-the-fly data race detection in multithreaded C++ programs
Eli Pozniansky,Assaf Schuster +1 more
- 22 Apr 2003
TL;DR: A novel testing tool, called MultiRace, which combines improved versions of Djit and Lockset - two very powerful on-the-fly algorithms for dynamic detection of apparent data races, and shows that the overheads imposed by MultiRace are often much smaller (orders of magnitude) than those obtained by other existing tools.
Designing memory consistency models for shared-memory multiprocessors
Sarita V. Adve
- 02 Jan 1993
TL;DR: This thesis establishes a unifying framework for designing memory models that can adequately satisfy the 3P criteria and applies debugging techniques for sequential consistency to two of the SCNF models to alleviate the problem of debugging programs onSCNF models.
Race Frontier: reproducing data races in parallel-program debugging
Jong-Deok Choi,Sang Lyul Min +1 more
- 01 Apr 1991
TL;DR: This paper presents a mechanism to debug data races in the execution of parallel programs by first identifying a RACE FRONTIER and then reproducing all the events, including data-race events?
98
References
The numerical analysis of ordinary differential equations: Runge-Kutta and general linear methods
TL;DR: The Euler Method and its Generalizations Analysis of Runge-Kutta Methods General Linear Methods Bibliography.
1.4K
•Book
Stability of Runge-Kutta Methods for Stiff Nonlinear Differential Equations
K. Dekker,J. G. Verwer +1 more
- 01 Dec 1984
921
•Book
The numerical analysis of ordinary differential equations
John C. Butcher
- 01 Jan 1987
TL;DR: In this article, a temperature control system for individual rooms within a home is disclosed having a pair of thermostatically controlled switches settable to "occupied" and "unoccupied" temperatures respectively with a clock controlled switching arrangement for determining which switch is effective during predetermined hours of the day.
800
Diagonally Implicit Runge–Kutta Methods for Stiff O.D.E.’s
TL;DR: In this paper, it was shown that no 4-stage method of this type has order 5, and that it is impossible for a strongly S-stable diagonally implicit method to attain order 4 in 4 stages.
690