Sorting networks and their applications
The DOI matches its Crossref record.
Abstract
To achieve high throughput rates today's computers perform several operations simultaneously. Not only are I/O operations performed concurrently with computing, but also, in multiprocessors, several computing operations are done concurrently. A major problem in the design of such a computing system is the connecting together of the various parts of the system (the I/O devices, memories, processing units, etc.) in such a way that all the required data transfers can be accommodated. One common scheme is a high-speed bus which is time-shared by the various parts; speed of available hardware limits this scheme. Another scheme is a cross-bar switch or matrix; limiting factors here are the amount of hardware (an m × n matrix requires m × n cross-points) and the fan-in and fan-out of the hardware.
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
Billion-scale similarity search with GPUs
Johnson, J., Douze, M., & Jégou, H. (2017) · arXiv · doi:10.48550/arxiv.1702.08734 · Cited by 4,140
“We use a variant of Batcher’s bitonic sorting network [8], which is a set of parallel merges on an array of size 2 k .”
MethodBillion-scale similarity search with GPUs
Johnson, J., Douze, M., & Jegou, H. (2021) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2019.2921572 · Cited by 4,228
A Survey of General‐Purpose Computation on Graphics Hardware
Owens, J. D., Luebke, D., Govindaraju, N., Harris, M., Krüger, J., Lefohn, A. E., & Purcell, T. J. (2007) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2007.01012.x · Cited by 2,101
Software protection and simulation on oblivious RAMs
Goldreich, O., & Ostrovsky, R. (1996) · Journal of the ACM · doi:10.1145/233551.233553 · Cited by 1,617
Owens, J. D., Houston, M., Luebke, D., Green, S., Stone, J. E., & Phillips, J. C. (2008) · Proceedings of the IEEE · doi:10.1109/jproc.2008.917757 · Cited by 1,495
Parallel Processing with the Perfect Shuffle
Stone, H. S. (1971) · IEEE Transactions on Computers · doi:10.1109/t-c.1971.223205 · Cited by 1,245
Private Circuits: Securing Hardware against Probing Attacks
Ishai, Y., Sahai, A., & Wagner, D. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_27 · Cited by 1,073
Optical interconnections for VLSI systems
Goodman, J. W., Leonberger, F. J., Kung, S.-Y., & Athale, R. A. (1984) · Proceedings of the IEEE · doi:10.1109/proc.1984.12943 · Cited by 1,052
Hillis, W. D., & Steele, G. L. (1986) · Communications of the ACM · doi:10.1145/7902.7903 · Cited by 899
High-speed switch scheduling for local-area networks
Anderson, T. E., Owicki, S. S., Saxe, J. B., & Thacker, C. P. (1993) · ACM Transactions on Computer Systems · doi:10.1145/161541.161736 · Cited by 892
Performance analysis of k-ary n-cube interconnection networks
Dally, W. J. (1990) · IEEE Transactions on Computers · doi:10.1109/12.53599 · Cited by 887
Translating Pseudo-Boolean Constraints into SAT
Eén, N., & Sörensson, N. (2006) · Journal on Satisfiability, Boolean Modeling and Computation · doi:10.3233/sat190014 · Cited by 587
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
Halder, R. K., Uddin, M. N., Uddin, M. A., Aryal, S., & Khraisat, A. (2024) · Journal of Big Data · doi:10.1186/s40537-024-00973-y · Cited by 520
Towards a theory of software protection and simulation by oblivious RAMs
Goldreich, O. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28416 · Cited by 507
GPUTeraSort: high performance graphics co-processor sorting for large database management
Govindaraju, N., Gray, J., Kumar, R., & Manocha, D. (2006) · Proceedings of the 2006 ACM SIGMOD international conference on Management of data · doi:10.1145/1142473.1142511 · Cited by 418
Tight Bounds on the Complexity of Parallel Sorting
Leighton, T. (1985) · IEEE Transactions on Computers · doi:10.1109/tc.1985.5009385 · Cited by 368
A comparison of sorting algorithms for the connection machine CM-2
Blelloch, G. E., Leiserson, C. E., Maggs, B. M., Plaxton, C. G., Smith, S. J., & Zagha, M. (1991) · Proceedings of the third annual ACM symposium on Parallel algorithms and architectures - SPAA '91 · doi:10.1145/113379.113380 · Cited by 335
Dynamic scheduling of network updates
Jin, X., Liu, H. H., Gandhi, R., Kandula, S., Mahajan, R., Zhang, M., Rexford, J., & Wattenhofer, R. (2014) · Proceedings of the 2014 ACM conference on SIGCOMM · doi:10.1145/2619239.2626307 · Cited by 329
The incremental garbage collection of processes
Baker, H. C., & Hewitt, C. (1977) · Proceedings of the 1977 symposium on Artificial intelligence and programming languages - · doi:10.1145/800228.806932 · Cited by 320
Prochlo: Strong Privacy for Analytics in the Crowd
Bittau, A., Erlingsson, Ú., Maniatis, P., Mironov, I., Raghunathan, A., Lie, D., Rudominer, M., Kode, U., Tinnes, J., & Seefeld, B. (2017) · Proceedings of the 26th Symposium on Operating Systems Principles · doi:10.1145/3132747.3132769 · Cited by 378
“Batcher’s sort is one such algorithm [8].”
Sort vs. Hash revisited: fast join implementation on modern multi-core CPUs
Kim, C., Kaldewey, T., Lee, V. W., Sedlar, E., Nguyen, A. D., Satish, N., Chhugani, J., Di Blas, A., & Dubey, P. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687553.1687564 · Cited by 280
Privacy-preserving matrix factorization
Nikolaenko, V., Ioannidis, S., Weinsberg, U., Joye, M., Taft, N., & Boneh, D. (2013) · Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13 · doi:10.1145/2508859.2516751 · Cited by 271
Computing connected components on parallel computers
Hirschberg, D. S., Chandra, A. K., & Sarwate, D. V. (1979) · Communications of the ACM · doi:10.1145/359138.359141 · Cited by 266
Ntru prime: Reducing attack surface at low cost
Bernstein, D. J., Chuengsatiansup, C., Lange, T., & van Vredendaal, C. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-72565-9_12 · Cited by 177
Fast in-place sorting with cuda based on bitonic sort
Peters, H., Schulz-Hildebrandt, O., & Luttenberger, N. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14390-8_42 · Cited by 54
GTalign: spatial index-driven protein structure alignment, superposition, and search
(2024) · doi:10.1038/s41467-024-51669-z · Cited by 23
Contrastive Learning for DeepFake Classification and Localization via Multi-Label Ranking
Hong, C.-Y., Hsu, Y.-C., & Liu, T.-L. (2024) · 2024 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr52733.2024.01669 · Cited by 23
Metadata
- Authors
- Batcher, K. E.
- Venue
- Proceedings of the April 30--May 2, 1968, spring joint computer conference on - AFIPS '68 (Spring)
- Publisher
- ACM Press
- Published
- 1968
- Pages
- 307
- OpenAlex
- W2141389982
- Cited by
- 2,417
- References
- 0
- Type
- conference abstract
- 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
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.