%0 Conference Proceedings
%T FRESA: A Frequency-Sensitive Sampling-Based Approach for Data Race Detection
%+ Services Computing Technology and System Lab [HUST]
%+ School of Computer Science and Technology
%A Huang, Neng
%A Shao, Zhiyuan
%A Jin, Hai
%Z Part 1: Session 1: Parallel Programming and Algorithms
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 10th International Conference on Network and Parallel Computing (NPC)
%C Guiyang, China
%Y Ching-Hsien Hsu
%Y Xiaoming Li
%Y Xuanhua Shi
%Y Ran Zheng
%I Springer
%3 Network and Parallel Computing
%V LNCS-8147
%P 49-60
%8 2013-09-19
%D 2013
%R 10.1007/978-3-642-40820-5_5
%K Concurrency
%K Data Race
%K Sampling
%K Bug Detection
%Z Computer Science [cs]Conference papers
%X Concurrent programs are difficult to debug due to the inherent concurrence and indeterminism. One of the problems is race conditions. Previous work on dynamic race detection includes fast but imprecise methods that report false alarms, and slow but precise ones that never report false alarms. Some researchers have combined these two methods. However, the overhead is still massive. This paper exploits the insight that full record on detector is unnecessary in most cases. Even prior sampling method has something to do to reduce overhead with precision guaranteed. That is, we can use a frequency-sensitive sampling approach. With our model on sampling dispatch, we can drop most unnecessary detection overhead. Experiment results on DaCapo benchmarks show that our heuristic sampling race detector is performance-faster and overhead-lower than traditional race detectors with no loss in precision, while never reporting false alarms.
%G English
%2 https://inria.hal.science/hal-01513753/document
%2 https://inria.hal.science/hal-01513753/file/978-3-642-40820-5_5_Chapter.pdf
%L hal-01513753
%U https://inria.hal.science/hal-01513753
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-NPC
%~ IFIP-LNCS-8147