ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 Experimental Performance Comparison of Dynamic Data Race Detection Techniques
Cited 8 time in scopus Download 134 time Share share facebook twitter linkedin kakaostory
저자
유미선, 박승민, 전인걸, 배두환
발행일
201702
출처
ETRI Journal, v.39 no.1, pp.124-134
ISSN
1225-6463
출판사
한국전자통신연구원 (ETRI)
DOI
https://dx.doi.org/10.4218/etrij.17.0115.1027
협약과제
15DS1100, DDS 기반의 통합개발지원환경 개발, 박승민
초록
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.
KSP 제안 키워드
CP detection, Data Race Detection, Dynamic race detection, Large-scale benchmark, Performance comparison, Running time, Runtime overhead, detection capability, detection techniques, dynamic data, experimental performance
본 저작물은 공공누리 제4유형 : 출처표시 + 상업적 이용금지 + 변경금지 조건에 따라 이용할 수 있습니다.
제4유형