The Community for Technology Leaders
RSS Icon
Subscribe
May 14, 2008 to May 16, 2008
ISBN: 978-0-7695-3131-1
pp: 409-414
ABSTRACT
Races in OpenMP programs must be detected because they may cause unintended nondeterministic results of programs. The Intel Thread Checker can detect the races occurred in an execution of OpenMP program, but it has not been analyzed on the limitation of its power for race detection in OpenMP programs.This paper empirically analyzes the functionality and performance of Thread Checker using a set of multithreaded synthetic programs. We have found that Thread Checker can not verify the existence of races in an execution of OpenMP program, and show that the ratio of the required time for race detection is dependent on the number of total accesses to shared variables in parallel section programs, but not in parallel loop programs.
INDEX TERMS
OpenMP, Race, Thread Checker, Verification, Parallel section programs, Parallel loop programs
CITATION
Young-Joo Kim, Daeyoung Kim, Yong-Kee Jun, "An Empirical Analysis of Intel Thread Checker for Detecting Races in OpenMP Programs", ICIS, 2008, Computer and Information Science, ACIS International Conference on, Computer and Information Science, ACIS International Conference on 2008, pp. 409-414, doi:10.1109/ICIS.2008.79
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool