Debugging multithreaded or parallel programs is a hard problem due to unintended non-deterministic results of the program, called data races. Previous race detection techniques have limitations of coverage for synchronization constructs in detecting first races for parallel programs with random synchronizations. We present, in this paper, an efficient two-pass algorithm to detect the first races in a particular execution of parallel program, by eliminating independent accesses to make a performance gain and candidate accesses, and then analyzing the traced information with candidate accesses by replaying the program. Therefore, our technique makes the race detection more practical in debugging parallel programs which have random synchronizations.
목차
Abstract 1. Introduction 2. Background 2.1. Candidate Set and Traced Accesses 3. First Race Detection using Trace and Replay 3.1. Algorithm 4. Conclusion References
키워드
data racerace detectionfirst raceconcurrent programmingparallel program debuggingrandom synchronizationmulti-threaded programmingparallel environmentstrace and replay
저자
Hee-Dong Park [ Joongbu University, Kumsan, Korea ]
Yong-Kee Jun [ Gyeongsang National University, Jinju, Korea ]
보안공학연구지원센터(IJSEIA) [Science & Engineering Research Support Center, Republic of Korea(IJSEIA)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Software Engineering and Its Applications
간기
월간
pISSN
1738-9984
수록기간
2008~2016
등재여부
SCOPUS
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Software Engineering and Its Applications Vol.8 No.7