Affiliation:
1. Chalmers University of Technology, Göteborg, Sweden
Abstract
In this article, we describe GPU-Quicksort, an efficient Quicksort algorithm suitable for highly parallel multicore graphics processors. Quicksort has previously been considered an inefficient sorting solution for graphics processors, but we show that in CUDA, NVIDIA's programing platform for general-purpose computations on graphical processors, GPU-Quicksort performs better than the fastest-known sorting implementations for graphics processors, such as radix and bitonic sort. Quicksort can thus be seen as a viable alternative for sorting large quantities of data on graphics processors.
Publisher
Association for Computing Machinery (ACM)
Subject
Theoretical Computer Science
Reference28 articles.
1. Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
2. Cederman D. and Tsigas P. 2007. GPU Quicksort Library. http://www.cs.chalmers.se/~dcs/gpuqsortdcs.html. Cederman D. and Tsigas P. 2007. GPU Quicksort Library. http://www.cs.chalmers.se/~dcs/gpuqsortdcs.html.
3. The periodic balanced sorting network
4. The parallel quicksort algorithm part i–run time analysis
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Enhancing Performance of CUDA Quicksort Through Pivot Selection and Branching Avoidance Methods;2023 XXIX International Conference on Information, Communication and Automation Technologies (ICAT);2023-06-11
2. Accelerating Sorting on GPUs: A Scalable CUDA Quicksort Revision;2023 22nd International Symposium INFOTEH-JAHORINA (INFOTEH);2023-03-15
3. New GPU Sorting Algorithm Using Sorted Matrix;Procedia Computer Science;2023
4. Sorting in Memristive Memory;ACM Journal on Emerging Technologies in Computing Systems;2022-10-13
5. ReCSA: a dedicated sort accelerator using ReRAM-based content addressable memory;Frontiers of Computer Science;2022-08-08