Improved GPU Co-processor Sorting Algorithm with Barrier Synchronization

K. Avinash, Monu Pandey, Ajinkya Deshpande, M. Rajasekhara Babu
M.Tech CSE, VIT University
International Journal of Applied Engineering Research, ISSN 0973-4562, Vol. 8, No. 19, 2013


   title={Improved GPU Co-processor Sorting Algorithm with Barrier Synchronization},

   author={Avinash, K and Pandey, Monu and Deshpande, Ajinkya and Babu, M Rajasekhara},

   journal={International Journal of Applied Engineering Research},





Download Download (PDF)   View View   Source Source   



Being sort is most frequent operation in science of computation, till date many sorting algorithms are proposed for CPUs & GPUs .Generally GPUs suffers with low memory sizes, due to this it is not possible to accommodate large data in GPU global Memory which arises external sorting techniques. These GPU based external sorting algorithms are memory intensive and their performance is also dependent on load balancing. This paper proposing an improved GPU sorting algorithm. It has two components: Splitter, which divides large data set into small data chunk, And Sorter which is responsible for sorting chunk of data available in global memory. This algorithm implemented with CUDA platform with an optimized memory contention technique. It showed a significant improvement in performance on large data sorting.
Rating: 3.2/5. From 10 votes.
Please wait...

* * *

* * *

HGPU group © 2010-2024 hgpu.org

All rights belong to the respective authors

Contact us: