Deterministic Sample Sort For GPUs

Details Deterministic Sample Sort For GPUs Deterministic Sample Sort For GPUs

2010-02-24

arxiv.org/abs/1002.4464v1

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

We present and evaluate GPU Bucket Sort, a parallel deterministic sample sort algorithm for many-core GPUs. Our method is considerably faster than Thrust Merge (Satish et.al., Proc. IPDPS 2009), the best comparison-based sorting algorithm for GPUs, and it is as fast as the new randomized sample sort for GPUs by Leischner et.al. (to appear in Proc. IPDPS 2010). Our 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.

Affiliated with

Also associated with

No associations

Rating

Deterministic Sample Sort For GPUs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Deterministic Sample Sort For GPUs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deterministic Sample Sort For GPUs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-260307