The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Efficient algorithms for all-to-all communications in multiport message-passing systems
Abstract
We present efficient algorithms for two all-to-all communication operations in message-passing systems: index (or all-to-all personalized communication) and concatenation (or all-to-all broadcast). We assume a model of a fully connected message-passing system, in which the performance of any point-to-point communication is independent of the sender-receiver pair. We also assume that each processor has k/spl ges/1 ports, through which it can send and receive k messages in every communication round. The complexity measures we use are independent of the particular system topology and are based on the communication start-up time, and on the communication bandwidth.
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
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
A survey of gossiping and broadcasting in communication networks
Hedetniemi, S. M., Hedetniemi, S. T., & Liestman, A. L. (1988) · Networks · doi:10.1002/net.3230180406 · Cited by 1,243
Solving Problems on Concurrent Processors
Fox, G. (1988) · Cited by 1,150
Generalized Hypercube and Hyperbus Structures for a Computer Network
Bhuyan, & Agrawal (1984) · IEEE Transactions on Computers · doi:10.1109/tc.1984.1676437 · Cited by 855
Cited by
Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Training
Lin, Y., Han, S., Mao, H., Wang, Y., & Dally, W. J. (2017) · arXiv · doi:10.48550/arxiv.1712.01887 · Cited by 1,134
Optimization of Collective Communication Operations in MPICH
Thakur, R., Rabenseifner, R., & Gropp, W. (2005) · The International Journal of High Performance Computing Applications · doi:10.1177/1094342005051521 · Cited by 911
Metadata
- Authors
- Bruck, J., Ho, C.-T., Kipnis, S., Upfal, E., & Weathersby, D.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 1997
- Volume
- 8
- Issue
- 11
- Pages
- 1143-1156
- ISSN
- 1045-9219 (ISSN-L)
- OpenAlex
- W2133557963
- Cited by
- 281
- References
- 5
- FWCI
- 1.27
- 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: Efficient algorithms for all-to-all communications in multiport message-passing systems. https://app.cochat.ai/papers/10.1109/71.642949
- The paper
- Bruck, J., Ho, C.-T., Kipnis, S., Upfal, E., & Weathersby, D. (1997). Efficient algorithms for all-to-all communications in multiport message-passing systems. IEEE Transactions on Parallel and Distributed Systems. https://doi.org/10.1109/71.642949
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.