On sorting and load balancing on GPUs
Distributed Computing and Systems, Chalmers University of Technology, SE-412 96 Göteborg, Sweden
SIGARCH Comput. Archit. News, Vol. 36, No. 5. (2008), pp. 11-18.
@article{cederman2009sorting,
title={On sorting and load balancing on gpus},
author={Cederman, D. and Tsigas, P.},
journal={ACM SIGARCH Computer Architecture News},
volume={36},
number={5},
pages={11–18},
issn={0163-5964},
year={2009},
publisher={ACM}
}
In this paper we take a look at GPU-Quicksort, an efficient Quicksort algorithm suitable for the highly parallel multi-core graphics processors. Quicksort had previously been considered an inefficient sorting solution for graphics processors, but 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 2, 2010 by hgpu
