Detecting data races is important in debugging shared memory parallel programs, because the races could exhibit unpredictable results in execution of programs. Unfortunately, previ- ous race detection techniques cannot guarantee that the detected accesses could be involved in the rst races to occur in parallel programs which contain random synchronizations. This paper presents a monitoring algorithm which collects ltered key accesses of local thread blocks that are involved in races comparing with the latest ltered accesses of the other concurrent thread blocks in a particular execution of parallel programs. We discard all the accesses other than key accesses in a block to perform the race condition determination, which makes our algorithm more ecient in time and space. We also demonstrate the cor- rectness of our algorithm by showing at least one of the collected candidate accesses would be included in the actual first races.
목차
Abstract 1. Introduction 2. Background 2.1. Programs with Random Synchronization 2.2. TheFirstRace 2.3. Race Detection Techniques 3. Detection of Candidate Accesses 4. Conclusion References
보안공학연구지원센터(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.7 No.2