5888

Introduction to GPU Radix Sort

Takahiro Harada, Lee Howes
Advanced Micro Devices, Inc.
Bonus in book "Heterogeneous Computing with OpenCL", published 2011 by Morgan Kaufman

@article{harada2011introduction,

   title={Introduction to GPU Radix Sort},

   author={Harada, T. and Howes, L.},

   booktitle={Heterogeneous Computing with OpenCL},

   year={2011}

}

Download Download (PDF)   View View   Source Source   Source codes Source codes

Package:

2681

views

Radix sort is one of the fastest sorting algorithms. It is fast especially for a large problem size. Radix sort is not a comparison sort but a counting sort. When we sort n bit keys, 2^n counters are prepared for each number.
No votes yet.
Please wait...
  • richard.kettlewell

    The DirectCompute version of the Radix Sort fails on my HD7950. Is this a known issue?

    No votes yet.
    Please wait...
  • hgpu

    The tests are passed on my HD5850.

    No votes yet.
    Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: