Helgrind+: An efficient dynamic race detector

Authors:
Ali Jannesari; Kaibin Bao;Victor Pankratius;Walter F. Tichy
Affiliations:
University of Karlsruhe, 76131, Germany;University of Karlsruhe, 76131, Germany;University of Karlsruhe, 76131, Germany;University of Karlsruhe, 76131, Germany
Venue:
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Year:
2009

Citing 0
Cited 5

Demand-driven software race detection using hardware performance counters

Proceedings of the 38th annual international symposium on Computer architecture
Exploiting cache traffic monitoring for run-time race detection

Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
Dynamic data race detection for correlated variables

ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
CARISMA: a context-sensitive approach to race-condition sample-instance selection for multithreaded applications

Proceedings of the 2012 International Symposium on Software Testing and Analysis
On-the-fly detection of data races in OpenMP programs

Proceedings of the 2012 Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging

Quantified Score

Hi-index	0.00

Visualization

Abstract

Finding synchronization defects is difficult due to non-deterministic orderings of parallel threads. Current tools for detecting synchronization defects tend to miss many data races or produce an overwhelming number of false alarms. In this paper, we describe Helgrind+, a dynamic race detection tool that incorporates correct handling of condition variables and a combination of the lockset algorithm and happens-before relation. We compare our techniques with Intel Thread Checker and the original Helgrind tool on two substantial benchmark suites. Helgrind+ reduces the number of both false negatives (missed races) and false positives. The additional accuracy incurs almost no performance overhead.