Introduction to GPU Radix Sort
Advanced Micro Devices, Inc.
Bonus in book "Heterogeneous Computing with OpenCL", published 2011 by Morgan Kaufman
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.
October 13, 2011 by hgpu
Comments
2 responses to “Introduction to GPU Radix Sort”
Your response
You must be logged in to post a comment.
The DirectCompute version of the Radix Sort fails on my HD7950. Is this a known issue?
The tests are passed on my HD5850.