Thursday 5 March 2009

GPU Radix Sort

In the ongoing search of finding efficient GPU sorting algorithms I came across the following paper:   by Nadathur Satish, Mark Harris, and Michael Garland.  It is a preprint for the 23rd IEEE Int’l Parallel & Distributed Processing Symposium, May 2009 (

I have not tested if it is faster than the GPU quicksort ( Normal quicksort does slow down on nearly sorted or already sorted data so a radix sort might exhibit more stable behaviour.

No comments:

Post a Comment