0 likes | 14 Vues
Shared-memory programs pose challenges for debugging due to non-deterministic memory races. This paper introduces Timetraveler, a novel approach that efficiently records and replays memory races in distributed systems. By exploiting the acyclicity of races, Timetraveler significantly reduces log size with minimal hardware overhead, outperforming existing schemes like Rerun. The mechanisms of post-dating and time-delay buffering help in detecting and ordering races, enhancing repeatability and scalability for debugging shared-memory programs.
E N D