Experimental Performance Comparison of Dynamic Data Race Detection Techniques

Cited 4 time in webofscience Cited 0 time in scopus
  • Hit : 329
  • Download : 274
Data races are one of the most difficult types of bugs in concurrent multithreaded systems. It requires significant time and cost to accurately detect bugs in complex largescale programs. Although many race detection techniques have been proposed by various researchers, none of them are effective in all aspects. In this paper, we compare the performance of five recent dynamic race detection techniques: FastTrack, Acculock, Multilock-HB, SimpleLock+, and causally precedes (CP) detection. We experimentally demonstrate the strengths and weaknesses of these dynamic race detection techniques in terms of their detection capability, running time, and runtime overhead using 20 benchmark programs with different characteristics. The comparison results show that the detection capability of CP detection does not differ from that of FastTrack, and that SimpleLock+ generates the lowest overhead among the hybrid detection techniques (Acculock, SimpleLock+, and Multilock-HB) for all benchmark programs. SimpleLock+ is 1.2 times slower than FastTrack on average, but misses one true data race reported from Mutilock-HB on the large-scale benchmark programs.
Publisher
ELECTRONICS TELECOMMUNICATIONS RESEARCH INST
Issue Date
2017-02
Language
English
Article Type
Article
Citation

ETRI JOURNAL, v.39, no.1, pp.124 - 134

ISSN
1225-6463
DOI
10.4218/etrij.17.0115.1027
URI
http://hdl.handle.net/10203/223314
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
000394359500014.pdf(1.21 MB)Download
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 4 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0