The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
LogGP: incorporating long messages into the LogP model---one step closer towards a realistic model for parallel computation
Abstract
We present a new model of parallel computation---the LogGP model---and use it to analyze a number of algorithms, most notably, the single node scatter (one-to-all personalized broadcast). The LogGP model is an extension of the LogP model for parallel computation which abstracts the communication of fixed-sized short messages through the use of four parameters: the communication latency (L), overhead (o), bandwidth (g), and the number of processors (P). As evidenced by experimental data, the LogP model can accurately predict communication performance when only short messages are sent (as on the CM-5). However, many existing parallel machines have special support for long messages and achieve a much higher bandwidth for long messages compared to short messages (e.g., IBM SP-2, Paragon, Meiko CS-2, Ncube/2). We extend the basic LogP model with a linear model for long messages. This combination, which we call the LogGP model of parallel computation, has one additional parameter, G, which captures the bandwidth obtained for long messages. Experimental data collected on the Meiko CS-2 shows that this simple extension of the LogP model can quite accurately predict communication performance for both short and long messages. This paper discusses algorithm design and analysis under the new model, examining the all-to-all remap, FFT, and radix sort. We also examine, in more detail, the single node scatter problem. We derive solutions for this problem and prove their optimality under the LogGP model. These solutions are qualitatively different from those obtained under the simpler LogP model, reflecting the importance of capturing long messages in a model.
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
Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes
Leighton, F. T. (1991) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2,460
LogP: towards a realistic model of parallel computation
Culler, D., Karp, R., Patterson, D., Sahay, A., Schauser, K. E., Santos, E., Subramonian, R., & von Eicken, T. (1993) · Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming - PPOPP '93 · doi:10.1145/155332.155333 · Cited by 1,496
Self-citationActive messages: a mechanism for integrated communication and computation
von Eicken, T., Culler, D. E., Goldstein, S. C., & Schauser, K. E. (1992) · Proceedings of the 19th annual international symposium on Computer architecture - ISCA '92 · doi:10.1145/139669.140382 · Cited by 1,393
Self-citationIntroduction to parallel computing: design and analysis of algorithms
Kumar, V., Grama, A. Y., Gupta, A., & Karypis, G. (1994) · Benjamin-Cummings Publishing Co., Inc. eBooks · Cited by 1,210
Parallel and distributed computation
Bertsekas, D. P., Tsitsiklis, J. N., & Sennikov, A. N. (1989) · Cited by 1,187
Parallelism in random access machines
Fortune, S., & Wyllie, J. (1978) · Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 · doi:10.1145/800133.804339 · Cited by 891
Parallel Algorithms for Shared-Memory Machines
Karp, R. M., & Ramachandran, V. (1990) · Elsevier eBooks · doi:10.1016/b978-0-444-88071-0.50022-9 · Cited by 687
Scans as primitive parallel operations
Blelloch, G. E. (1989) · IEEE Transactions on Computers · doi:10.1109/12.42122 · Cited by 538
The APRAM: incorporating asynchrony into the PRAM model
Cole, R. J., & Zajicek, O. (1989) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/72935.72954 · Cited by 163
Cited by
Versatile, scalable, and accurate simulation of distributed applications and platforms
Casanova, H., Giersch, A., Legrand, A., Quinson, M., & Suter, F. (2014) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2014.06.008 · Cited by 415
Dissecting the Graphcore IPU Architecture via Microbenchmarking
Jia, Z., Tillman, B., Maggioni, M., & Scarpazza, D. P. (2019) · arXiv · doi:10.48550/arxiv.1912.03413 · Cited by 83
Metadata
- Authors
- Alexandrov, A., Ionescu, M. F., Schauser, K. E., & Scheiman, C.
- Venue
- Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures - SPAA '95
- Publisher
- ACM Press
- Published
- 1995
- Pages
- 95-105
- OpenAlex
- W2042120213
- Cited by
- 488
- References
- 10
- FWCI
- 11.04
- 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: LogGP: incorporating long messages into the LogP model---one step closer towards a realistic model for parallel computation. https://app.cochat.ai/papers/10.1145/215399.215427
- The paper
- Alexandrov, A., Ionescu, M. F., Schauser, K. E., & Scheiman, C. (1995). LogGP: incorporating long messages into the LogP model---one step closer towards a realistic model for parallel computation. Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures - SPAA '95. https://doi.org/10.1145/215399.215427
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.