Affiliation:
1. School of Computer Science, Carleton University, Ottawa, Canada
Abstract
We demonstrate that parallel deterministic sample sort for many-core GPUs (GPU BUCKET SORT) is not only considerably faster than the best comparison-based sorting algorithm for GPUs (THRUST MERGE [Satish et.al., Proc. IPDPS 2009]) but also as fast as randomized sample sort for GPUs (GPU SAMPLE SORT [Leischner et.al., Proc. IPDPS 2010]). However, deterministic sample sort has the advantage that bucket sizes are guaranteed and therefore its running time does not have the input data dependent fluctuations that can occur for randomized sample sort.
Publisher
World Scientific Pub Co Pte Lt
Subject
Hardware and Architecture,Theoretical Computer Science,Software
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. New GPU Sorting Algorithm Using Sorted Matrix;Procedia Computer Science;2023
2. Bibliography;An Introduction to Parallel Programming;2022
3. Parallel program development;An Introduction to Parallel Programming;2022
4. Accelerating the Unacceleratable;Proceedings of the 15th International Workshop on Data Management on New Hardware - DaMoN'19;2019
5. A Study of Integer Sorting on Multicores;Parallel Processing Letters;2018-12