A fast and flexible sorting algorithm with CUDA

Shifu Chen; Jing Qin; Yongming Xie; Junping Zhao; Pheng Ann Heng

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

A fast and flexible sorting algorithm with CUDA

Shifu Chen, Jing Qin, Yongming Xie, Junping Zhao, Pheng Ann Heng

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

15 Citations (Scopus)

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.

Original language	English
Title of host publication	Algorithms and Architectures for Parallel Processing - 9th International Conference, ICA3PP 2009, Proceedings
Pages	281-290
Number of pages	10
DOIs	https://doi.org/10.1007/978-3-642-03095-6_28
Publication status	Published - 21 Sept 2009
Externally published	Yes
Event	9th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2009 - Taipei, Taiwan Duration: 8 Jun 2009 → 11 Jun 2009

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5574 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	9th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2009
Country/Territory	Taiwan
City	Taipei
Period	8/06/09 → 11/06/09

Keywords

CUDA
GPU-based sorting algorithm
Parallel sorting algorithm

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

More information

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

Cite this

Chen, S., Qin, J., Xie, Y., Zhao, J., & Heng, P. A. (2009). A fast and flexible sorting algorithm with CUDA. In Algorithms and Architectures for Parallel Processing - 9th International Conference, ICA3PP 2009, Proceedings (pp. 281-290). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5574 LNCS). https://doi.org/10.1007/978-3-642-03095-6_28

@inproceedings{b19eda8af21e4a80b69db2e3aa5d638a,

title = "A fast and flexible sorting algorithm with CUDA",

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 = "CUDA, GPU-based sorting algorithm, Parallel sorting algorithm",

author = "Shifu Chen and Jing Qin and Yongming Xie and Junping Zhao and Heng, {Pheng Ann}",

year = "2009",

month = sep,

day = "21",

doi = "10.1007/978-3-642-03095-6_28",

language = "English",

isbn = "3642030947",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "281--290",

booktitle = "Algorithms and Architectures for Parallel Processing - 9th International Conference, ICA3PP 2009, Proceedings",

note = "9th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2009 ; Conference date: 08-06-2009 Through 11-06-2009",

}

Chen, S, Qin, J, Xie, Y, Zhao, J & Heng, PA 2009, A fast and flexible sorting algorithm with CUDA. in Algorithms and Architectures for Parallel Processing - 9th International Conference, ICA3PP 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5574 LNCS, pp. 281-290, 9th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2009, Taipei, Taiwan, 8/06/09. https://doi.org/10.1007/978-3-642-03095-6_28

A fast and flexible sorting algorithm with CUDA. / Chen, Shifu; Qin, Jing; Xie, Yongming et al.
Algorithms and Architectures for Parallel Processing - 9th International Conference, ICA3PP 2009, Proceedings. 2009. p. 281-290 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5574 LNCS).

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

TY - GEN

T1 - A fast and flexible sorting algorithm with CUDA

AU - Chen, Shifu

AU - Qin, Jing

AU - Xie, Yongming

AU - Zhao, Junping

AU - Heng, Pheng Ann

PY - 2009/9/21

Y1 - 2009/9/21

N2 - 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.

AB - 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.

KW - CUDA

KW - GPU-based sorting algorithm

KW - Parallel sorting algorithm

UR - http://www.scopus.com/inward/record.url?scp=70349127789&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-03095-6_28

DO - 10.1007/978-3-642-03095-6_28

M3 - Conference article published in proceeding or book

SN - 3642030947

SN - 9783642030949

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 281

EP - 290

BT - Algorithms and Architectures for Parallel Processing - 9th International Conference, ICA3PP 2009, Proceedings

T2 - 9th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2009

Y2 - 8 June 2009 through 11 June 2009

ER -

Chen S, Qin J, Xie Y, Zhao J, Heng PA. A fast and flexible sorting algorithm with CUDA. In Algorithms and Architectures for Parallel Processing - 9th International Conference, ICA3PP 2009, Proceedings. 2009. p. 281-290. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-03095-6_28

A fast and flexible sorting algorithm with CUDA

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this