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

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

CHALLENGES IN PARALLEL GRAPH PROCESSING

LUMSDAINE, ANDREW, GREGOR, DOUGLAS, HENDRICKSON, BRUCE, BERRY, JONATHAN·2007·Parallel Processing Letters

Abstract

Graph algorithms are becoming increasingly important for solving many problems in scientific computing, data mining and other domains. As these problems grow in scale, parallel computing resources are required to meet their computational and memory requirements. Unfortunately, the algorithms, software, and hardware that have worked well for developing mainstream parallel scientific applications are not necessarily effective for large-scale graph problems. In this paper we present the inter-relationships between graph problems, software, and parallel hardware in the current state of the art and discuss how those issues present inherent challenges in solving large-scale graph problems. The range of these challenges suggests a research agenda for the development of scalable high-performance software for graph problems.

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.1142/s0129626407002843

Cites

8 of 8 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 8 references

Cited by

See all 469

Metadata

Authors
LUMSDAINE, A., GREGOR, D., HENDRICKSON, B., & BERRY, J.
Venue
Parallel Processing Letters
Published
2007-03
Volume
17
Issue
01
Pages
5-20
ISSN
  • 0129-6264 (ISSN-L)
  • 1793-642X
OpenAlex
W2046526098
Cited by
469
References
8
FWCI
13.09
Type
journal article
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: CHALLENGES IN PARALLEL GRAPH PROCESSING. https://app.cochat.ai/papers/10.1142/s0129626407002843
The paper
LUMSDAINE, A., GREGOR, D., HENDRICKSON, B., & BERRY, J. (2007). CHALLENGES IN PARALLEL GRAPH PROCESSING. Parallel Processing Letters. https://doi.org/10.1142/s0129626407002843

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.