The DOI matches its Crossref record.
A taxonomy of parallel sorting
Open accessAbstract
We propose a taxonomy of parallel sorting that encompasses a broad range of array-and file-sorting algorithms.We analyze how research on parallel sorting has evolved, from the earliest sorting networks to shared memory algorithms and VLSI sorters.In the context of sorting networks, we describe two fundamental parallel merging schemes: the odd-even and the bitonic merge.We discuss sorting algorithms that evolved from these merging schemes for parallel computers, whose processors communicate through interconnection networks such as the perfect shuffle, the mesh, and a number of other sparse networks.Following our discussion of network sorting algorithms, we describe how faster algorithms have been derived from parallel enumeration sorting schemes, where, with a shared memory model of parallel computation, keys are first ranked and then rearranged according to their rank.Parallel sorting algorithms are evaluated according to several criteria related to both the time complexity of an algorithm and its feasibility from the viewpoint of computer architecture.We show that, in addition to attractive communication schemes, network sorting algorithms have nonadaptive schedules that make them suitable for implementation.In particular, they are easily generalized to block sorting algorithms, which utilize limited parallelism to solve large sorting problems.We also address the problem of sorting large mass-storage files in parallel, using modified disk devices or intelligent bubble memory.We conclude by mentioning VLSI sorting as an active and promising direction for research on parallel sorting.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cited by
Query evaluation techniques for large databases
Graefe, G. (1993) · ACM Computing Surveys · doi:10.1145/152610.152611 · Cited by 1,262
Memory coherence in shared virtual memory systems
Li, K., & Hudak, P. (1989) · ACM Transactions on Computer Systems · doi:10.1145/75104.75105 · Cited by 1,167
A method for taxonomy development and its application in information systems
Nickerson, R. C., Varshney, U., & Muntermann, J. (2013) · European Journal of Information Systems · doi:10.1057/ejis.2012.26 · Cited by 1,143
Metadata
- Authors
- Bitton, D., DeWitt, D. J., Hsaio, D. K., & Menon, J.
- Venue
- ACM Computing Surveys
- Published
- 1984-09-02
- Volume
- 16
- Issue
- 3
- Pages
- 287-318
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2068822255
- Cited by
- 169
- References
- 0
- FWCI
- 15.77
- Type
- journal article
- 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 taxonomy of parallel sorting. https://app.cochat.ai/papers/10.1145/2514.2516
- The paper
- Bitton, D., DeWitt, D. J., Hsaio, D. K., & Menon, J. (1984). A taxonomy of parallel sorting. ACM Computing Surveys. https://doi.org/10.1145/2514.2516
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.