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
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.
Integrity signals
Registry
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.
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
A Bridging Model for Parallel Computation
Valiant, L. G. (1990) · ACM eBooks · doi:10.1145/3749740.3749753 · Cited by 3,664
OpenMP: an industry standard API for shared-memory programming
Dagum, L., & Menon, R. (1998) · IEEE Computational Science and Engineering · doi:10.1109/99.660313 · Cited by 3,343
An introduction to parallel algorithms
JáJá, J. F. (1992) · Cited by 1,600
Open MPI: Goals, Concept, and Design of a Next Generation MPI Implementation
Gabriel, E., Fagg, G. E., Bosilca, G., Angskun, T., Dongarra, J. J., Squyres, J. M., Sahay, V., Kambadur, P., Barrett, B., Lumsdaine, A., et al. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30218-6_19 · Cited by 1,591
Self-citationMPI - The Complete Reference: Volume 2, The MPI Extensions
Gropp, W., Huss-Lederman, S., Lumsdaine, A., Lusk, E., Nitzberg, B., Saphir, W., & Snir, M. (1998) · The MIT Press eBooks · doi:10.7551/mitpress/4789.001.0001 · Cited by 700
Self-citationA Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L
Yoo, A., Chow, E., Henderson, K., McLendon, W., Hendrickson, B., & Catalyurek, U. (2005) · ACM/IEEE SC 2005 Conference (SC'05) · doi:10.1109/sc.2005.4 · Cited by 261
Self-citationDesigning Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
Bader, D. A., & Madduri, K. (2006) · 2006 International Conference on Parallel Processing (ICPP'06) · doi:10.1109/icpp.2006.34 · Cited by 216
Parallel shortest path algorithms for solving large-scale instances
Madduri, K., Bader, D. A., Berry, J. W., et al. (2009) · DIMACS series in discrete mathematics and theoretical computer science · doi:10.1090/dimacs/074/10 · Cited by 48
Self-citation
Cited by
X-Stream: edge-centric graph processing using streaming partitions
Roy, A., Mihailovic, I., & Zwaenepoel, W. (2013) · Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles · doi:10.1145/2517349.2522740 · Cited by 673
Graph of Thoughts: Solving Elaborate Problems with Large Language Models
Besta, M., Blach, N., Kubicek, A., Gerstenberger, R., Podstawski, M., Gianinazzi, L., Gajda, J., Lehmann, T., Niewiadomski, H., Nyczyk, P., et al. (2024) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v38i16.29720 · Cited by 556
Scalable SPARQL querying of large RDF graphs
Huang, J., Abadi, D. J., & Ren, K. (2011) · Proceedings of the VLDB Endowment · doi:10.14778/3402707.3402747 · Cited by 461
Trinity: a distributed graph engine on a memory cloud
Shao, B., Wang, H., & Li, Y. (2013) · Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2463676.2467799 · Cited by 432
McCune, R. R., Weninger, T., & Madey, G. (2015) · ACM Computing Surveys · doi:10.1145/2818185 · Cited by 294
Metadata
- Authors
- LUMSDAINE, A., GREGOR, D., HENDRICKSON, B., & BERRY, J.
- Venue
- Parallel Processing Letters
- Publisher
- World Scientific Pub Co Pte Lt
- 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.