A roadmap of parallel sorting algorithms using GPU computing

Abstract

In today's world, sorting is a basic need and appropriate method starts with searching. Several sorting algorithms has been developed on CPU (Central Processing Unit). But according to current scenario, CPU is not so efficient in sorting. To get the more speedup of sorting algorithms parallelization should b e done. There are many ways of Parallelizing sorting methods which can be performed by using different tools. But for achieving high efficiency GPU (Graphics Processing Unit) comuting is the most preferable way. The authors of this paper surveyed various aspects in the direction of research of GPU based sorting algorithms. This paper also refined the different research gaps based on GPU sorting algorithms like parallel (Merge, Quick, Bitonic, Odd-Even, Count, and Radix etc.) by using GPU computing with CUDA (Compute Unified Device Architecture). Future re s e arch will motivate to do the work in GPU architecture.