An Efficient Point-to-Point Deterministic Record-Replay Enhanced with Signatures

Abstract

Shared-memory multithreaded programs running on chip multiprocessors (CMPs) tend to be nondeterministic. Two-phase deterministic record-replay is an effective approach to solve this nondeterminism. This paper proposes an efficient deterministic record-replay named Fly Replay. During recording, Fly Replay logs not only the right dependencies of memory races but also the pseudo dependencies constituted by predecessors of memory races into per-thread log. During replay, Fly Replay produces wakeup messages actively to trigger successors in time, achieving low communication overhead and fast replay speed. At the same time, Fly Replay reduces hardware overhead by using hardware signatures. Simulation shows that Fly Replay reduces the log size for splash2 workloads by 40% on average compared with RTR and Rerun in 4-core systems, and has good scalability in log size. More importantly, Fly Repaly can achieve replay speed within 1%~18% of the native execution speed without record-replay.