A Practical Quicksort Algorithm for Graphics Processors
Department of Computer Science and Engineering, Chalmers University of Technology and Goteborg University, SE-412 96 Goteborg, Sweden
Algorithms – ESA 2008 In ESA ’08: Proceedings of the 16th annual European symposium on Algorithms, Vol. 5193 (2008), pp. 246-258.
@article{cederman2008practical,
title={A practical quicksort algorithm for graphics processors},
author={Cederman, D. and Tsigas, P.},
journal={Algorithms-ESA 2008},
pages={246–258},
year={2008},
publisher={Springer}
}
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.
November 6, 2010 by hgpu
