Earticle

초록

영어

It is still difficult and cumbersome to locate where a program runs into data races, because they may lead to unpredictable results of the program. To detect data races occurred during an execution of parallel programs, previous work provides large runtime and space overhead or focuses on reducing false positives. Thus, the prior detectors are still imprecise and inefficient, when applied to large scale parallel programs. This paper presents an efficient data race detection technique, called EDP that analyzes conflicting accesses to every shared memory location. Our technique precisely reports data races because it guarantees to locate at least one data race for each shared memory location, if there exists any, and provides a significant improvement of efficiency as O(1) space and time overheads for each access history.

목차

Abstract
 1. Introduction
 2. Background
  2.1. Lock-Set Analysis
  2.2. Happens-before Analysis
  2.3. Hybrid Method
 3. Efficient Data Race Detection
 4. Experimentation
 5. Conclusion
 Acknowledgements
 References

키워드

저자

• Ok-kyoon Ha [ Engineering Research Institute, Gyeongsang National University ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Software Engineering and Its Applications

• 간기

  월간

• pISSN

  1738-9984

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605