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

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Optimistic parallelism requires abstractions

Kulkarni, Milind, Pingali, Keshav, Walter, Bruce, Ramanarayanan, Ganesh, Bala, Kavita, Chew, L. Paul·2007·Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation
DOI 10.1145/1250734.1250759
Open this paper in CoChat — free account

Abstract

Irregular applications, which manipulate large, pointer-based data structures like graphs, are difficult to parallelize manually. Automatic tools and techniques such as restructuring compilers and run-time speculative execution have failed to uncover much parallelism in these applications, in spite of a lot of effort by the research community. These difficulties have even led some researchers to wonder if there is any coarse-grain parallelism worth exploiting in irregular applications.

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/1250734.1250759

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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

Cites

Show all 1 references

Cited by

See all 441

Metadata

Authors
Kulkarni, M., Pingali, K., Walter, B., Ramanarayanan, G., Bala, K., & Chew, L. P.
Venue
Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation
Publisher
ACM
Published
2007-06-10
Pages
211-222
ISSN
1531-7102 (ISSN-L)
DOI
10.1145/1250734.1250759
OpenAlex
W2097717378
Cited by
441
References
1
FWCI
28.84
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: Optimistic parallelism requires abstractions. https://app.cochat.ai/papers/10.1145/1250734.1250759
The paper
Kulkarni, M., Pingali, K., Walter, B., Ramanarayanan, G., Bala, K., & Chew, L. P. (2007). Optimistic parallelism requires abstractions. Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation. https://doi.org/10.1145/1250734.1250759

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.