The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
A comparison of sorting algorithms for the connection machine CM-2
Open accessAbstract
We have implemented three parallel sorting algorithms on the Connection Machine Supercomputer model CM-2: B atcher's bitonic sort, a parallel radix sor~and a sample sort similar to Reif and Valiant's flashsort.We have also evaluated the implementation of many other sorting algorithms proposed in the literature.Our computational experiments show that the sample sort algorithm, which is a theoretically efficient "randomized" algorithm, is the fastest of the three algorithms on large data sets.On a 64Kprocessor CM-2, our sample sort implementation can sort 32 x 106 64-bit keys in 5.1 seconds, which is over 10 times faster than the CM-2 library sort.Our implementation of radix sort, although not as fast on large data sets, is deterministic, much simpler to code, stable, faster with small keys, and faster on small data sets (few elements per processor), Our implementation of bitonic sor~which is pipelined to use all the hypercube wires simultaneously, is the least efficient of the three on large data sets, but is the most efficient on small data sets, and is considerably more space efficient.This paper analyzes the three algorithms in detail and discusses many practical issues that led us to the particular implementations.
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
Sorting networks and their applications
Batcher, K. E. (1968) · Proceedings of the April 30--May 2, 1968, spring joint computer conference on - AFIPS '68 (Spring) · doi:10.1145/1468075.1468121 · Cited by 2,417
Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
Rajasekaran, S., & Reif, J. H. (1989) · SIAM Journal on Computing · doi:10.1137/0218041 · Cited by 171
Fast probabilistic algorithms for hamiltonian circuits and matchings
Angluin, D., & Valiant, L. G. (1977) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800105.803393 · Cited by 113
Cited by
The SPLASH-2 programs: characterization and methodological considerations
Woo, S. C., Ohara, M., Torrie, E., Singh, J. P., & Gupta, A. (1995) · Proceedings of the 22nd annual international symposium on Computer architecture - ISCA '95 · doi:10.1145/223982.223990 · Cited by 3,624
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
Sparse Matrices in MATLAB: Design and Implementation
Gilbert, J. R., Moler, C., & Schreiber, R. (1992) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0613024 · Cited by 591
Designing efficient sorting algorithms for manycore GPUs
Satish, N., Harris, M., & Garland, M. (2009) · 2009 IEEE International Symposium on Parallel & Distributed Processing · doi:10.1109/ipdps.2009.5161005 · Cited by 571
Metadata
- Authors
- Blelloch, G. E., Leiserson, C. E., Maggs, B. M., Plaxton, C. G., Smith, S. J., & Zagha, M.
- Venue
- Proceedings of the third annual ACM symposium on Parallel algorithms and architectures - SPAA '91
- Publisher
- ACM Press
- Published
- 1991
- Volume
- 39
- Pages
- 3-16
- OpenAlex
- W241684218
- Cited by
- 335
- References
- 3
- FWCI
- 7.65
- Type
- conference paper
- Language
- en
- Open access
- bronze
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: A comparison of sorting algorithms for the connection machine CM-2. https://app.cochat.ai/papers/10.1145/113379.113380
- The paper
- Blelloch, G. E., Leiserson, C. E., Maggs, B. M., Plaxton, C. G., Smith, S. J., & Zagha, M. (1991). A comparison of sorting algorithms for the connection machine CM-2. Proceedings of the third annual ACM symposium on Parallel algorithms and architectures - SPAA '91. https://doi.org/10.1145/113379.113380
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.