An OpenCL Method of Parallel Sorting Algorithms for GPU Architecture
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
@article{thouti2012opencl,
title={An OpenCL Method of Parallel Sorting Algorithms for GPU Architecture},
author={Thouti, K. and Sathe, SR},
year={2012}
}
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.
August 18, 2012 by hgpu
