The implementation and optimization of Bitonic sort algorithm based on CUDA
arXiv:1506.01446 [cs.DC], (4 Jun 2015)
@article{mu2015implementation,
title={The implementation and optimization of Bitonic sort algorithm based on CUDA},
author={Mu, Qi and Cui, Liqing and Song, Yufei},
year={2015},
month={jun},
archivePrefix={"arXiv"},
primaryClass={cs.DC}
}
This paper describes in detail the bitonic sort algorithm,and implements the bitonic sort algorithm based on cuda architecture. At the same time,we conduct two effective optimization of implementation details according to the characteristics of the GPU, which greatly improve the efficiency. Finally,we survey the optimized Bitonic sort algorithm on the GPU with the speedup of quick sort algorithm on the CPU. Since Quick Sort is not suitable to be implemented in parallel, but it is more efficient than other sorting algorithms on CPU to some extend.Hence,to see the speedup and performance, we compare bitonic sort on GPU with quick Sort on CPU. For a series of 32-bit random integer, the experimental results show that the acceleration of our work is nearly 20 times. When array size is about 216,the speedup ratio is even up to 30.
June 7, 2015 by hgpu
