Fast Four-Way Parallel Radix Sorting on GPUs

Simple item page
dc.contributor.authorHa, Linhen_US
dc.contributor.authorKrueger, Jensen_US
dc.contributor.authorSilva, Claudio T.en_US
dc.date.accessioned2015-02-23T09:30:13Z
dc.date.available2015-02-23T09:30:13Z
dc.date.issued2009en_US
dc.description.abstractEfficient sorting is a key requirement for many computer science algorithms. Acceleration of existing techniques as well as developing new sorting approaches is crucial for many real-time graphics scenarios, database systems, and numerical simulations to name just a few. It is one of the most fundamental operations to organize and filter the ever growing massive amounts of data gathered on a daily basis. While optimal sorting models for serial execution on a single processor exist, efficient parallel sorting remains a challenge. In this paper, we present a hardware-optimized parallel implementation of the radix sort algorithm that results in a significant speed up over existing sorting implementations. We outperform all known General Processing Unit (GPU) based sorting systems by about a factor of two and eliminate restrictions on the sorting key space. This makes our algorithm not only the fastest, but also the first general GPU sorting solution.en_US
dc.description.number8en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume28en_US
dc.identifier.doi10.1111/j.1467-8659.2009.01542.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages2368-2378en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2009.01542.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltden_US
dc.titleFast Four-Way Parallel Radix Sorting on GPUsen_US
Files
Collections
28-Issue 8