Experimental Performance Comparison of Dynamic Data Race Detection Techniques. Issue 1 (1st February 2017)

• Record Type: Journal Article
• Authors: Yu, Misun; Park, Seung‐Min; Chun, Ingeol; Bae, Doo‐Hwan
• Is Part Of: ETRI journal. Volume 39:Issue 1(2017)
• Page Start: 124
• Page End: 134
• Publication Date: 2017-02-01
• Subjects: Data race -- Dynamic detection -- Multithreaded programming -- Debugging -- happens before -- Lockset -- Causally precedes; Telecommunication -- Periodicals; Electronics -- Periodicals; Electronics; Telecommunication; Periodicals; Periodicals; 621.38205
• DOI: 10.4218/etrij.17.0115.1027
• Languages: English
• ISSNs: 1225-6463

Abstract

Abstract : 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 large‐scale 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.