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

The DOI matches its Crossref record.

The tao of parallelism in algorithms

Pingali, Keshav, Nguyen, Donald, Kulkarni, Milind, Burtscher, Martin, Hassaan, M. Amber, Kaleem, Rashid, Lee, Tsung-Hsien, Lenharth, Andrew, Manevich, Roman, Méndez-Lojo, Mario, Prountzos, Dimitrios, Sui, Xin · 2011 · Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation

Abstract

For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in "regular" algorithms that use dense arrays, such as finite-differences and FFTs. In this paper, we argue that the dependence graph is not a suitable abstraction for algorithms in new application areas like machine learning and network analysis in which the key data structures are "irregular" data structures like graphs, trees, and sets.

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

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 234

Metadata

Authors
Pingali, K., Nguyen, D., Kulkarni, M., Burtscher, M., Hassaan, M. A., Kaleem, R., Lee, T.-H., Lenharth, A., Manevich, R., Méndez-Lojo, M., Prountzos, D., & Sui, X.
Venue
Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation
Publisher
ACM
Published
2011-06-04
Pages
12-25
ISSN
1531-7102 (ISSN-L)
OpenAlex
W4232836277
Cited by
234
References
0
FWCI
10.95
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: The tao of parallelism in algorithms. https://app.cochat.ai/papers/10.1145/1993498.1993501
The paper
Pingali, K., Nguyen, D., Kulkarni, M., Burtscher, M., Hassaan, M. A., Kaleem, R., Lee, T.-H., Lenharth, A., Manevich, R., Méndez-Lojo, M., Prountzos, D., & Sui, X. (2011). The tao of parallelism in algorithms. Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation. https://doi.org/10.1145/1993498.1993501

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.