An OpenCL Method of Parallel Sorting Algorithms for GPU Architecture

Krishnahari Thouti, S. R. Sathe
Department of Computer Science Engg., Visvesvaraya National Institute of Technology, Nagpur, 440010, Maharashtra, India
International Journal of Experimental Algorithms (IJEA), Volume 3, Issue 1, 2012

   title={An OpenCL Method of Parallel Sorting Algorithms for GPU Architecture},

   author={Thouti, K. and Sathe, SR},



Download Download (PDF)   View View   Source Source   



In this paper, we present a comparative performance analysis of different parallel sorting algorithms: Bitonic sort and Parallel Radix Sort. In order to study the interaction between the algorithms and architecture, we implemented both the algorithms in OpenCL and compared its performance with Quick Sort algorithm, the fastest algorithm. In our simulation, we have used Intel Core2Duo CPU 2.67GHz and NVidia Quadro FX 3800 as graphical processing unit.
VN:F [1.9.22_1171]
Rating: 0.0/5 (0 votes cast)

* * *

* * *

Follow us on Twitter

HGPU group

1895 peoples are following HGPU @twitter

Like us on Facebook

HGPU group

423 people like HGPU on Facebook

HGPU group © 2010-2016 hgpu.org

All rights belong to the respective authors

Contact us: