Earticle

초록

영어

It is difficult and troublesome to detect data races occurred in an execution of parallel programs. On-the-fly race detection techniques use monitoring to threads and events, which access to shared variables. Any of them using Lamport's happened-before relation needs a thread labeling scheme for generating unique identifiers which maintain logical concurrency information of the parallel threads. Previous labeling schemes for on-the-fly race detection in parallel programs with nested parallelism depend on the nesting depth on every fork and join operation. This paper presents e-NR (Extended Nest Region) labeling in which every thread generates and maintains its label in a constant amount of time and space. Experimental results using OpenMP programs show that presented labeling detects data races more efficiently, because it requires reduced time overhead about 10% and it 3.2 times smaller than previous labeling scheme in average space for race detection.

목차

Abstract
 1. Introduction
 2. Background
  2.1. Programs with Nested Parallelism
  2.2. On-the-fly Race Detection
  2.3. Motivation
 3. Extended NR Labeling
  3.1. NR Labels
  3.2. e-NR Labeling
 4. Evaluation
  4.1. Experimentation
  4.2. OpenMP Synthetic Programs
 5. Conclusion
 References

키워드

저자

• Ok-Kyoon Ha [ Department of Informatics Gyeongsang National University Jinju, Republic of Korea ]
• Yong-Kee Jun [ Department of Informatics Gyeongsang National University Jinju, Republic of Korea ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of u- and e- Service, Science and Technology

• 간기

  격월간

• pISSN

  2005-4246

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605