A Practical Quicksort Algorithm for Graphics Processors
Paper i proceeding, 2008

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.

Sorting

Graphics Processors

GPU

Parallel Sorting

GPU-Quicksort

Författare

Daniel Cederman

Chalmers, Data- och informationsteknik, Nätverk och system

Philippas Tsigas

Chalmers, Data- och informationsteknik, Nätverk och system

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 5193 246-258

Ämneskategorier

Datorteknik

Programvaruteknik

Datavetenskap (datalogi)

DOI

10.1007/978-3-540-87744-8_21

Mer information

Skapat

2017-10-07