RaceTrack
Yuan Yu, Tom Rodeheffer, Wei Chen · 2005
Bugs due to data races in multithreaded programs often exhibit non-deterministic symptoms and are notoriously difficult to find. This paper describes RaceTrack, a dynamic race detection tool that tracks the actions of a program and reports a warning whenever a suspicious pattern of activity has been observed. RaceTrack uses a novel hybrid detection algorithm and employs an adaptive approach that automatically directs more effort to areas that are more suspicious, thus providing more accurate warnings for much less over-head. A post-processing step correlates warnings and ranks code segments based on how strongly they are implicated in potential data races. We implemented RaceTrack inside the virtual machine of Microsoft's Common Language Runtime (product version v1.1.4322) and monitored several major, real-world applications directly out-of-the-box,without any modification. Adaptive tracking resulted in a slowdown ratio of about 3x on memory-intensive programs and typically much less than 2x on other programs,and a memory ratio of typically less than 1.2x. Several serious data race bugs were revealed, some previously unknown.
Cited by 264 works. doi:10.1145/1095810.1095832
Authors
References
- Time, clocks, and the ordering of events in a distributed system
- Eraser
- Virtual Time and Global States of Distributed Systems
- Boxwood: abstractions as the foundation for storage infrastructure
- Type-based race detection for Java
- Proceedings of the 5th symposium on Operating systems design and implementation - OSDI '02
- On-the-fly detection of data races for programs with nested fork-join parallelism
- An empirical comparison of monitoring algorithms for access anomaly detection
- Techniques for debugging parallel programs with flowback analysis
- Efficient and precise datarace detection for multithreaded object-oriented programs