GPU-quicksort, a practical quicksort algorithm for graphics processors. 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.
Keywords for this software
References in zbMATH (referenced in 7 articles )
Showing results 1 to 7 of 7.
- Beliakov, Gleb; Kelarev, Andrei; Yearwood, John: Derivative-free optimization and neural networks for robust regression (2012)
- Fouz, Mahmoud; Kufleitner, Manfred; Manthey, Bodo; Zeini Jahromi, Nima: On smoothed analysis of quicksort and Hoare’s find (2012)
- Soman, Jyothish; Kothapalli, Kishore; Narayanan, P.J.: Discrete range searching primitive for the GPU and its applications (2012)
- Edelkamp, Stefan; Sulewski, Damian: External memory breadth-first search with delayed duplicate detection on the GPU (2011) ioport
- Cederman, Daniel; Tsigas, Philippas: GPU-quicksort, a practical quicksort algorithm for graphics processors (2009)
- Fouz, Mahmoud; Kufleitner, Manfred; Manthey, Bodo; Jahromi, Nima Zeini: On smoothed analysis of Quicksort and Hoare’s find (2009)
- Cederman, Daniel; Tsigas, Philippas: A practical Quicksort algorithm for graphics processors (2008) ioport