927

GPU-Quicksort: A practical Quicksort algorithm for graphics processors

Daniel Cederman, Philippas Tsigas
Chalmers University of Technology
J. Exp. Algorithmics, Vol. 14 (2009)

@article{cederman2009gpu,

   title={GPU-Quicksort: A practical Quicksort algorithm for graphics processors},

   author={Cederman, D. and Tsigas, P.},

   journal={J. Exp. Algorithmics},

   volume={14},

   pages={1–4},

   year={2009},

   publisher={Citeseer}

}

Download Download (PDF)   View View   Source Source   

1557

views

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.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: