publication . Part of book or chapter of book . 2008

A Practical Quicksort Algorithm for Graphics Processors

Daniel Cederman; Philippas Tsigas;
Open Access
  • Published: 30 Aug 2008
  • Publisher: Springer Berlin Heidelberg
Abstract
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.
Subjects
ACM Computing Classification System: Data_FILESComputingMethodologies_COMPUTERGRAPHICS
Download from
http://www.cs.chalmers.se/~tsi...
Part of book or chapter of book
Provider: UnpayWall
http://www.springerlink.com/in...
Part of book or chapter of book . 2008
Provider: Crossref
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue