To support incremental replay of message-passing applications. processes must periodically checkpoint and the content of some messages must be logged, to break dependencies of the current slate of the execution on past events. This paper shows that known adaptive logging algorithms are likely to introduce deadlocks in replay, and we introduce a new algorithm that: (i) prevents deadlocks in replay and (ii) enables the tuning of its behavior to meet specific user needs
Abstract. Deadlocks widely exist in real-world multithreaded programs. Ex-isting predictive strategi...
Ability to replay a program’s execution on a multi-processor system can significantly help parallel ...
AbstractDeadlocks are a common error in programs with lock-based concurrency and are hard to avoid o...
To support incremental replay of message-passing applications. processes must periodically checkpoin...
To support incremental replay of message-passing applications, processes must periodically checkpoin...
To support incremental replay of message-passing applications, processes must periodically checkpoin...
To support incremental replay of message-passing applications, processes must periodically checkpoin...
Part 1: Full PapersInternational audienceDebugging of concurrent systems is a tedious and error-pron...
While a lot of work has been focused on design and programming of shared memory multi-core architect...
Deadlocked threads cannot make further progress, and frequently tie up resources requested by still ...
none3siCausal-consistent reversible debugging is an innovative technique for debugging concurrent sy...
A message is {\it in-transit} with respect to a global state if its sending is recorded in this glob...
Checkpointing is widely used in robust fault-tolerant applications. We present an efficient incremen...
Significant time is spent by companies trying to reproduce and fix bugs. BugNet is a recent architec...
Abstract. This paper presents a dynamic program analysis algorithm that can detect deadlock potentia...
Abstract. Deadlocks widely exist in real-world multithreaded programs. Ex-isting predictive strategi...
Ability to replay a program’s execution on a multi-processor system can significantly help parallel ...
AbstractDeadlocks are a common error in programs with lock-based concurrency and are hard to avoid o...
To support incremental replay of message-passing applications. processes must periodically checkpoin...
To support incremental replay of message-passing applications, processes must periodically checkpoin...
To support incremental replay of message-passing applications, processes must periodically checkpoin...
To support incremental replay of message-passing applications, processes must periodically checkpoin...
Part 1: Full PapersInternational audienceDebugging of concurrent systems is a tedious and error-pron...
While a lot of work has been focused on design and programming of shared memory multi-core architect...
Deadlocked threads cannot make further progress, and frequently tie up resources requested by still ...
none3siCausal-consistent reversible debugging is an innovative technique for debugging concurrent sy...
A message is {\it in-transit} with respect to a global state if its sending is recorded in this glob...
Checkpointing is widely used in robust fault-tolerant applications. We present an efficient incremen...
Significant time is spent by companies trying to reproduce and fix bugs. BugNet is a recent architec...
Abstract. This paper presents a dynamic program analysis algorithm that can detect deadlock potentia...
Abstract. Deadlocks widely exist in real-world multithreaded programs. Ex-isting predictive strategi...
Ability to replay a program’s execution on a multi-processor system can significantly help parallel ...
AbstractDeadlocks are a common error in programs with lock-based concurrency and are hard to avoid o...