Rerun
Derek R. Hower, Mark D. Hill · ACM SIGARCH Computer Architecture News · 2008
Multiprocessor deterministic replay has many potential uses in the era of multicore computing, including enhanced debugging, fault tolerance, and intrusion detection. While sources of nondeterminism in a uniprocessor can be recorded efficiently in software, it seems likely that hardware support will be needed in a multiprocessor environment where the outcome of memory races must also be recorded.We develop a memory race recording mechanism, called Rerun, that uses small hardware state (~166 bytes/core), writes a small race log (~4 bytes/kilo- instruction), and operates well as the number of cores per system scales (e.g., to16cores). Rerun exploits the dual of conventional wisdom in race recording: Rather than record information about individual memory accesses that conflict, we record how long a thread executes without conflicting with other threads. In particular, Rerun passively creates atomic episodes. Each episode is a dynamic instruction sequence that a thread happens to execute without interacting with other threads. Rerun uses Lamport Clocks to order episodes and enable replay of an equivalent execution.
Cited by 137 works. doi:10.1145/1394608.1382144
Authors
References
- Time, clocks, and the ordering of events in a distributed system
- ReVirt
- Multifacet's general execution-driven multiprocessor simulator (GEMS) toolset
- Debugging Parallel Programs with Instant Replay
- Recovery Oriented Computing (ROC): Motivation, Definition, Techniques, and Case Studies
- Proceedings of the 1999 International Conference on Parallel Processing
- Universal classes of hash functions (Extended Abstract)
- Hypervisor-based fault tolerance
- Transactional Memory Coherence and Consistency
- A "flight data recorder" for enabling full-system multiprocessor deterministic replay