Results 1 - 10 of 146

Partial Replay of Long-Running Applications

by Alvin Cheung, O Solar-lezama, Samuel Madden
"... Bugs in deployed software can be extremely difficult to track down. Invasive logging techniques, such as logging all nondeterministic inputs, can incur substantial runtime overheads. This paper shows how symbolic analysis can be used to re-create path equivalent executions for very long running prog ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
inputs processed by the application, as well as the state of memory before these inputs were executed. We implemented our technique in a new tool called bbr. In this paper, we show that it can be used to replay bugs in long-running single-threaded programs starting from the middle of an execution. We

Optimal Tracing and Replay for Debugging Message-Passing Parallel Programs

by Robert H. B. Netzer, Barton P. Miller - In Proceedings of Supercomputing '92 , 1992
"... A common debugging strategy involves reexecuting a program (on a given input) over and over, each time gaining more information about bugs. Such techniques can fail on message-passing parallel programs. Because of variations in message latencies and process scheduling, different runs on the given in ..."
Abstract - Cited by 89 (1 self) - Add to MetaCart
A common debugging strategy involves reexecuting a program (on a given input) over and over, each time gaining more information about bugs. Such techniques can fail on message-passing parallel programs. Because of variations in message latencies and process scheduling, different runs on the given

Execution replay and debugging

by Michiel Ronsse, Koen De Bosschere, Jacques Chassin De Kergommeaux - Proceedings of the Fourth International Workshop on Automated Debugging (AADEBUG2000 , 2000
"... As most parallel and distributed programs are internally non-deterministic – consecutive runs with the same input might result in a different program flow – vanilla cyclic debugging techniques as such are useless. In order to use cyclic debugging tools, we need a tool that records information about ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
As most parallel and distributed programs are internally non-deterministic – consecutive runs with the same input might result in a different program flow – vanilla cyclic debugging techniques as such are useless. In order to use cyclic debugging tools, we need a tool that records information about

New Techniques for Replay Debugging

by Daniel B. Price , 1998
"... Many systems have implemented replay of parallel or sequential processes, but none have provided a robust set of debugger tools that take advantage of this power. This paper develops new ideas about how software instruction counters can be used by programmers to facilitate debugging applications ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Many systems have implemented replay of parallel or sequential processes, but none have provided a robust set of debugger tools that take advantage of this power. This paper develops new ideas about how software instruction counters can be used by programmers to facilitate debugging applications

Optimal Tracing and Replay for Debugging Shared-Memory Parallel Programs

by Robert Netzer, Robert H. B. Netzer - In Proceedings of the ACM/ONR Workshop on Parallel and Distributed Debugging (PADD , 1993
"... Execution replay is a crucial part of debugging. Because explicitly parallel shared-memory programs can be nondeterministic, a tool is required that traces executions so they can be replayed for debugging. We present an adaptive tracing strategy that is optimal and records the minimal number of shar ..."
Abstract - Cited by 96 (0 self) - Add to MetaCart
Execution replay is a crucial part of debugging. Because explicitly parallel shared-memory programs can be nondeterministic, a tool is required that traces executions so they can be replayed for debugging. We present an adaptive tracing strategy that is optimal and records the minimal number

Abstract PARALLEL PROGRAM DEBUGGING BASED ON DATA-REPLAY

by Masao Maruyama, Tomoaki Tsumura, Hiroshi Nakashima
"... Nondeterministic nature of parallel programs is the major difficulty in debugging. Order-replay, a technique to solve this problem, is widely used because of its small overhead. It has, however, several serious drawbacks: all processes of the parallel program have to participate in replay even when ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
Nondeterministic nature of parallel programs is the major difficulty in debugging. Order-replay, a technique to solve this problem, is widely used because of its small overhead. It has, however, several serious drawbacks: all processes of the parallel program have to participate in replay even when

Debugging Parallel Programs with Instant Replay 471

by Thomas J, Leblanc, John M. Mellor-crummey
"... Abstract-The debugging cycle is the most common methodology for finding and correcting errors in sequential programs. Cyclic debugging is effective because sequential programs are usually deterministic. Debugging parallel programs is considerably more difficult because successive executions of the s ..."
Abstract - Add to MetaCart
of the same program often do not produce the same results. In this paper we present a general solution for reproducing the execution behavior of parallel programs, termed Instant Replay. During program execution we save the relative order of significant events as they occur, not the data associated

Cyclic Debugging Using Execution Replay

by Michiel Ronsse, Mark Christiaens, Koen De Bosschere
"... Abstract. This paper presents a tool that enables programmers to use cyclic debugging techniques for debugging non-deterministic parallel programs. The solution consists of a combination of record/replay with automatic on-the-fly data race detection. This combination enables us to limit the record p ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
Abstract. This paper presents a tool that enables programmers to use cyclic debugging techniques for debugging non-deterministic parallel programs. The solution consists of a combination of record/replay with automatic on-the-fly data race detection. This combination enables us to limit the record

Optimal Record and Replay for Debugging of Nondeterministic MPIRVM Programs

by Qilong Zheng, Guoliang Chen, Liusheng Huang
"... {qlzheng, glchen, lshuang} @ ustc. edu. cn Record and Replay technique has been proved an effective solution to cyclic debugging of nondeterministic parallel program. Because of nondeterminism, a parallel program given the same inputs on successive runs can sometimes produces different results. In ..."
Abstract - Add to MetaCart
{qlzheng, glchen, lshuang} @ ustc. edu. cn Record and Replay technique has been proved an effective solution to cyclic debugging of nondeterministic parallel program. Because of nondeterminism, a parallel program given the same inputs on successive runs can sometimes produces different results

Jockey: A user-space library for record-replay debugging

by Yasushi Saito - In AADEBUG’05: Proceedings of the sixth international symposium on Automated analysis-driven debugging , 2005
"... Jockey is an execution record/replay tool for debugging Linux programs. It records invocations of system calls and CPU instructions with timing-dependent effects and later replays them deterministically. It supports process checkpointing to diagnose long-running programs efficiently. Jockey is imple ..."
Abstract - Cited by 77 (0 self) - Add to MetaCart
Jockey is an execution record/replay tool for debugging Linux programs. It records invocations of system calls and CPU instructions with timing-dependent effects and later replays them deterministically. It supports process checkpointing to diagnose long-running programs efficiently. Jockey
Results 1 - 10 of 146