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
