Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 229

The DOI matches its Crossref record.

On-the-fly detection of data races for programs with nested fork-join parallelism

Mellor-Crummey, John·1991·Proceedings of the 1991 ACM/IEEE conference on Supercomputing - Supercomputing '91

Abstract

Detecting data races in shared-memory parallel programs is an important debugging problem. This paper presents a new protocol for run-time detection of data races in executions of shared-memory programs with nested fork-join parallelism and no other interthread synchronization. This protocol has significantly smaller worst-case run-time overhead than previous techniques. The worst-case space required by our protocol when monitoring an execution of a program P is O(VN), whereV is the number of shared variables in P,andN is the maximum dynamic nesting of parallel constructs in P ’s execution. The worst-case time required to perform any monitoring operation is O(N). We formally prove that our new protocol always reports a non-empty subset of the data races in a monitored program execution and describe how this property leads to an effective debugging strategy. 1

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/125826.125861

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 229

Metadata

Authors
Mellor-Crummey, J.
Venue
Proceedings of the 1991 ACM/IEEE conference on Supercomputing - Supercomputing '91
Publisher
ACM Press
Published
1991
Pages
24-33
ISSN
1063-9535 (ISSN-L)
OpenAlex
W2170200862
Cited by
229
References
0
FWCI
6.35
Type
conference paper
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: On-the-fly detection of data races for programs with nested fork-join parallelism. https://app.cochat.ai/papers/10.1145/125826.125861
The paper
Mellor-Crummey, J. (1991). On-the-fly detection of data races for programs with nested fork-join parallelism. Proceedings of the 1991 ACM/IEEE conference on Supercomputing - Supercomputing '91. https://doi.org/10.1145/125826.125861

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.