GPU sample sort

2010 ◽  
Author(s):  
Nikolaj Leischner ◽  
Vitaly Osipov ◽  
Peter Sanders
Keyword(s):  
Sample Sort

Sample Sort

2012 ◽  
pp. 307-313
Author(s):  
Michael McCool ◽  
Arch D. Robison ◽  
James Reinders
Keyword(s):  
Sample Sort

scholarly journals DETERMINISTIC SAMPLE SORT FOR GPUS

2012 ◽  
Vol 22 (03) ◽  
pp. 1250008 ◽  
Author(s):  
FRANK DEHNE ◽  
HAMIDREZA ZABOLI
Keyword(s):  
Input Data ◽  
Sorting Algorithm ◽  
Running Time ◽  
Sample Sort ◽  
Many Core

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.

Super Scalar Sample Sort

2004 ◽  
pp. 784-796 ◽  
Author(s):  
Peter Sanders ◽  
Sebastian Winkel
Keyword(s):  
Sample Sort
Sign in / Sign up

Export Citation Format

Share Document