A Practical Quicksort Algorithm for Graphics Processors

  • Daniel Cederman
  • Philippas Tsigas
Conference paper

DOI: 10.1007/978-3-540-87744-8_21

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5193)
Cite this paper as:
Cederman D., Tsigas P. (2008) A Practical Quicksort Algorithm for Graphics Processors. In: Halperin D., Mehlhorn K. (eds) Algorithms - ESA 2008. ESA 2008. Lecture Notes in Computer Science, vol 5193. 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Daniel Cederman
    • 1
  • Philippas Tsigas
    • 1
  1. 1.Department of Computer Science and EngineeringChalmers University of TechnologyGöteborgSweden

Personalised recommendations