By Topic

Space efficient data race detection for parallel programs with series-parallel task graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
K. Audenaert ; ELIS, Ghent Univ., Belgium ; L. Levrouw

A data race or access anomaly is a bug in parallel programs, occurring when two parallel processes access the same shared resource in an unsynchronised fashion, and at least one access modifies the resource. The effects of a data race can be non-deterministic and can give the program debugger a very hard time. Race detection represents a class of methods which automatically detect the presence of data races in a parallel program. This paper deals with on-the-fly methods, in which race detection is performed at run-time, during the execution of the program. We present a novel method for on-the-fly race detection, which reduces the storage requirements by several orders of magnitude over previous methods. Moreover, the method is language independent and can handle the problems associated with pointer variables (aliasing). The programs it deals with are restricted to those that have a series-parallel task graph. This includes fork-join and spawning types of parallelism

Published in:

Parallel and Distributed Processing, 1995. Proceedings. Euromicro Workshop on

Date of Conference:

25-27 Jan 1995