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

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))
Proceedings of the 16th Annual European Symposium on Algorithms (ESA 2008), Lecture Notes in Computer Science. (0302-9743). Vol. 5193 (2008), p. 246-258.
[Konferensbidrag, refereegranskat]

In this paper we present GPU-Quicksort, an efficient Quicksort algorithm suitable for highly parallel multi-core graphics processors. Quicksort has previously been considered as an inefficient sorting solution for graphics processors, but we show that GPU-Quicksort often 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: Sorting, Graphics Processors, GPU-Quicksort, Parallel Sorting, GPU



Denna post skapades 2008-09-20.
CPL Pubid: 74184

 

Läs direkt!


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