CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

GPU-Quicksort: A practical Quicksort algorithm for graphics processors

Daniel Cederman (Institutionen för data- och informationsteknik, Nätverk och system, Datakommunikation och distribuerade system (Chalmers)) ; Philippas Tsigas (Institutionen för data- och informationsteknik, Nätverk och system, Datakommunikation och distribuerade system (Chalmers))
Journal of Experimental Algorithmics (1084-6654). Vol. 14 (2009), 4,
[Artikel, refereegranskad vetenskaplig]

In this article, we describe GPU-Quicksort, an efficient Quicksort algorithm suitable for highly parallel multicore graphics processors. Quicksort has previously been considered an inefficient sorting solution for graphics processors, but we show that in CUDA, NVIDIA's programing platform for general-purpose computations on graphical processors, GPU-Quicksort performs better than the fastest-known sorting implementations for graphics processors, such as radix and bitonic sort. Quicksort can thus be seen as a viable alternative for sorting large quantities of data on graphics processors.

Nyckelord: CUDA, GPGPU, Sorting, multicore, quicksort



Denna post skapades 2009-08-21.
CPL Pubid: 96344

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)