Back to Search
Start Over
A comparison-free sorting algorithm on CPUs and GPUs.
- Source :
-
Journal of Supercomputing . Nov2018, Vol. 74 Issue 11, p6369-6400. 32p. - Publication Year :
- 2018
-
Abstract
- This paper presents a new sorting algorithm that sorts input data elements without any comparison operations between the data—comparison-free sorting. Our algorithm’s time complexity is on the order of O(N) for both single- and multi-threaded CPU and many-core GPU implementations. Our results show speedups on average of 4.6 × , 4 × , and 3.5 × for single-threaded CPU, 8-threaded CPU, and many-threaded GPU implementations, respectively, for input sizes ranging from 27 to 230 elements as compared to common sorting algorithms for a wide variation of element distributions, ranging from all unique elements to a single repeated element. In addition, our proposed algorithm more efficiently utilizes the GPU architecture as compared to a multi-core CPU architecture, showing a speedup of approximately 4 × for input sizes ranging from 27 to 230 elements. [ABSTRACT FROM AUTHOR]
- Subjects :
- *ALGORITHM software
*SPEED
Subjects
Details
- Language :
- English
- ISSN :
- 09208542
- Volume :
- 74
- Issue :
- 11
- Database :
- Academic Search Index
- Journal :
- Journal of Supercomputing
- Publication Type :
- Academic Journal
- Accession number :
- 133020131
- Full Text :
- https://doi.org/10.1007/s11227-018-2567-3