Compile-time Support for Efficient Data Race Detection in Shared-Memory Parallel Programs (1992)
| Venue: | In Proceedings of the ACM/ONR Workshop on Parallel and Distributed Debugging |
| Citations: | 27 - 1 self |
BibTeX
@INPROCEEDINGS{Mellor-crummey92compile-timesupport,
author = {John Mellor-crummey and John Mellor-crummey},
title = {Compile-time Support for Efficient Data Race Detection in Shared-Memory Parallel Programs},
booktitle = {In Proceedings of the ACM/ONR Workshop on Parallel and Distributed Debugging},
year = {1992},
pages = {129--139}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Data race detection strategies based on software runtime monitoring are notorious for dramatically inflating execution times of shared-memory parallel programs. Without significant reductions in the execution overhead incurred when using these techniques, there is little hope that they will be widely used. A promising approach to this problem is to apply compile-time analysis to identify variable references that need not be monitored at run time because they will never be involved in a data race. In this paper we describe eraser, a data race instrumentation tool that uses aggressive program analysis to prune the number of references to be monitored. To quantify the effectiveness of our analysis techniques, we compare the overhead of race detection with three levels of compile-time analysis ranging from little analysis to aggressive interprocedural analysis for a suite of test programs. For the programs tested, using interprocedural analysis and dependence analysis dramatically reduced ...
