A Fast and Flexible Sorting Algorithm with CUDA

  • Shifu Chen
  • Jing Qin
  • Yongming Xie
  • Junping Zhao
  • Pheng-Ann Heng
Conference paper

DOI: 10.1007/978-3-642-03095-6_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5574)
Cite this paper as:
Chen S., Qin J., Xie Y., Zhao J., Heng PA. (2009) A Fast and Flexible Sorting Algorithm with CUDA. In: Hua A., Chang SL. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2009. Lecture Notes in Computer Science, vol 5574. Springer, Berlin, Heidelberg

Abstract

In this paper, we propose a fast and flexible sorting algorithm with CUDA. The proposed algorithm is much more practical than the previous GPU-based sorting algorithms, as it is able to handle the sorting of elements represented by integers, floats and structures. Meanwhile, our algorithm is optimized for the modern GPU architecture to obtain high performance. We use different strategies for sorting disorderly list and nearly-sorted list to make it adaptive. Extensive experiments demon- strate our algorithm has higher performance than previous GPU-based sorting algorithms and can support real-time applications.

Keywords

Parallel sorting algorithm CUDA GPU-based sorting algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Shifu Chen
    • 1
  • Jing Qin
    • 2
  • Yongming Xie
    • 2
  • Junping Zhao
    • 3
  • Pheng-Ann Heng
    • 1
    • 2
  1. 1.Shenzhen Institute of Advanced Integration TechnologyChinese Academy of Sciences/The Chinese University of Hong KongHong Kong
  2. 2.Department of Computer Science and EngineeringThe Chinese University of Hong KongHong Kong
  3. 3.Institue of Medical InformaticsChinese PLA General Hospital & Postgraduate Medical SchoolChina

Personalised recommendations