The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Designing efficient sorting algorithms for manycore GPUs
Abstract
We describe the design of high-performance parallel radix sort and merge sort routines for manycore GPUs, taking advantage of the full programmability offered by CUDA. Our radix sort is the fastest GPU sort and our merge sort is the fastest comparison-based sort reported in the literature. Our radix sort is up to 4 times faster than the graphics-based GPUSort and greater than 2 times faster than other CUDA-based radix sorts. It is also 23% faster, on average, than even a very carefully optimized multicore CPU sorting routine. To achieve this performance, we carefully design our algorithms to expose substantial fine-grained parallelism and decompose the computation into independent tasks that perform minimal global communication. We exploit the high-speed onchip shared memory provided by NVIDIA's GPU architecture and efficient data-parallel primitives, particularly parallel scan. While targeted at GPUs, these algorithms should also be well-suited for other manycore processors.
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
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 15,999
The Art of Computer Programming
Whitesides, G. E. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19705 · Cited by 6,008
The Art of Computer Programming: Volume 3: Sorting and Searching
Knuth, D. E. (1973) · Cited by 3,955
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
Nickolls, J., Buck, I., Garland, M., & Skadron, K. (2008) · Queue · doi:10.1145/1365490.1365500 · Cited by 1,610
Self-citation(2008) · doi:10.1145/1401132.1401152 · Cited by 1,575
Self-citationNVIDIA Tesla: A Unified Graphics and Computing Architecture
Lindholm, E., Nickolls, J., Oberman, S., & Montrym, J. (2008) · IEEE Micro · doi:10.1109/mm.2008.31 · Cited by 1,362
Cole, R. (1988) · SIAM Journal on Computing · doi:10.1137/0217049 · Cited by 724
Mars: a MapReduce framework on graphics processors
He, B., Fang, W., Luo, Q., Govindaraju, N. K., & Wang, T. (2008) · Proceedings of the 17th international conference on Parallel architectures and compilation techniques · doi:10.1145/1454115.1454152 · Cited by 715
Parallel Prefix Sum (Scan) with CUDA
Harris, M. (2011) · Cited by 537
Self-citationScan Primitives for GPU Computing
Sengupta, S., Harris, M., Zhang, Y., & Owens, J. D. (2007) · eScholarship (California Digital Library) · doi:10.2312/eggh/eggh07/097-106 · Cited by 510
Self-citationVector models for data-parallel computing
Blelloch, G. E. (1990) · Cited by 472
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
Lauterbach, C., Garland, M., Sengupta, S., Luebke, D., & Manocha, D. (2009) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2009.01377.x · Cited by 404
Self-citationA 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
Efficient implementation of sorting on multi-core SIMD CPU architecture
Chhugani, J., Nguyen, A. D., Lee, V. W., Macy, W., Hagog, M., Chen, Y.-K., Baransi, A., Kumar, S., & Dubey, P. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1454159.1454171 · Cited by 232
MCUDA: An Efficient Implementation of CUDA Kernels for Multi-core CPUs
Stratton, J. A., Stone, S. S., & Hwu, W.-M. W. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-89740-8_2 · Cited by 208
Mars: Accelerating MapReduce with Graphics Processors
Fang, W., He, B., Luo, Q., et al. (2010) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2010.158 · Cited by 153
Efficient gather and scatter operations on graphics processors
He, B., Govindaraju, N. K., Luo, Q., et al. (2007) · Proceedings - Supercomputing · doi:10.1145/1362622.1362684 · Cited by 128
GPU-ABiSort: optimal parallel sorting on stream architectures
Greb, A., & Zachmann, G. (2006) · doi:10.5555/1898953.1898980 · Cited by 99
A Practical Quicksort Algorithm for Graphics Processors
Cederman, D., & Tsigas, P. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-87744-8_21 · Cited by 87
MCUDA: An Efficient Implementation of CUDA Kernels on Multi-cores
Stratton, J. A., Stone, S. S., & Hwu, A. W.-M. W. (2011) · Cited by 53
GPU-ABiSort: optimal parallel sorting on stream architectures
Greb, A., & Zachmann, G. (2006) · Proceedings - IEEE International Parallel and Distributed Processing Symposium · doi:10.1109/ipdps.2006.1639284 · Cited by 47
Cited by
Implementing molecular dynamics on hybrid high performance computers – short range forces
Brown, W. M., Wang, P., Plimpton, S. J., & Tharrington, A. N. (2011) · Computer Physics Communications · doi:10.1016/j.cpc.2010.12.021 · Cited by 703
Debunking the 100X GPU vs. CPU myth: an evaluation of throughput computing on CPU and GPU
Lee, V. W., Kim, C., Chhugani, J., Deisher, M., Kim, D., Nguyen, A. D., Satish, N., Smelyanskiy, M., Chennupaty, S., Hammarlund, P., et al. (2010) · Proceedings of the 37th annual international symposium on Computer architecture · doi:10.1145/1815961.1816021 · Cited by 640
Self-citationBell, N., & Hoberock, J. (2012) · GPU Computing Gems Jade Edition · doi:10.1016/b978-0-12-385963-1.00026-5 · Cited by 402
Debunking the 100X GPU vs. CPU myth: an evaluation of throughput computing on CPU and GPU
Lee, V. W., Kim, C., Chhugani, J., Deisher, M., Kim, D., Nguyen, A. D., Satish, N., Smelyanskiy, M., Chennupaty, S., Hammarlund, P., et al. (2010) · ACM SIGARCH Computer Architecture News · doi:10.1145/1816038.1816021 · Cited by 267
Self-citationState-of-the-art in Heterogeneous Computing
Brodtkorb, A. R., Dyken, C., Hagen, T. R., Hjelmervik, J. M., & Storaasli, O. O. (2010) · Scientific Programming · doi:10.1155/2010/540159 · Cited by 257
Metadata
- Authors
- Satish, N., Harris, M., & Garland, M.
- Venue
- 2009 IEEE International Symposium on Parallel & Distributed Processing
- Publisher
- IEEE
- Published
- 2009-05
- Pages
- 1-10
- OpenAlex
- W2118558147
- Cited by
- 571
- References
- 25
- FWCI
- 40.77
- 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
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.