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


Vol. 9,  No. 4, pp. 525-534, Dec.  2002
10.3745/KIPSTA.2002.9.4.525


PDF
  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
  Cite this article

[IEEE Style]

S. H. Park, J. J. Woo, J. M. Bae, Y. K. Jun, "A Labeling Scheme for Efficient On-the-fly Detection of Race Conditions in Parallel Programs," The KIPS Transactions:PartA, 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. The KIPS Transactions:PartA, 9, 4, (2002), 525-534. DOI: 10.3745/KIPSTA.2002.9.4.525.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals