A Labeling Scheme for Efficient On-the-fly Detection of Race Conditions in Parallel Programs


KIPS Transactions on Computer and Communication Systems, Vol. 9, No. 4, pp. 525-534, Dec. 2002
10.3745/KIPSTA.2002.9.4.525,   PDF Download:

Abstract

Race conditions, races in short, need to be detected for debugging parallel programs, because the races result in unintended non-deterministic executions. To detect the races in an execution of program, previous techniques use a centralized data structure which may incur serious bottleneck in generating concurrency information, or show inefficient time complexity which depends on the degree of nested parallelism in comparing any two of them. We propose a new labeling scheme in this paper, which is scalable in generating the concurrency information without bottleneck by using private data structure, and improves time complexity into constant in checking concurrency. The scalability and time efficiency therfore makes on-the-fly race detection efficient not only for programs with either shared-memory or message-passing, but also for programs with mixed model of the two.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. H. Park, J. J. Woo, J. M. Bae and Y. K. Jun, "A Labeling Scheme for Efficient On-the-fly Detection of Race Conditions in Parallel Programs," KIPS Journal A (2001 ~ 2012) , vol. 9, no. 4, pp. 525-534, 2002. DOI: 10.3745/KIPSTA.2002.9.4.525.

[ACM Style]
So Hee Park, Jong Jung Woo, Jong Min Bae, and Yong Kee Jun. 2002. A Labeling Scheme for Efficient On-the-fly Detection of Race Conditions in Parallel Programs. KIPS Journal A (2001 ~ 2012) , 9, 4, (2002), 525-534. DOI: 10.3745/KIPSTA.2002.9.4.525.