PARALLELIZATION OF BITONIC SORT AND RADIX SORT ALGORITHMS ON MANY CORE GPUS
No Thumbnail Available
Date
2013
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Ieee
Open Access Color
OpenAIRE Downloads
OpenAIRE Views
Abstract
Data sorting is used in many fields and plays an important role in defining the overall speed and performance. There are many sorting categories. In this study, two of these sorting algorithms that are bitonic sort and radix sort are dealt with. We have designed and developed Radix Sort and Bitonic Sort algorithms for many core Graphics Processing Units (GPUs). Although bitonic sort is a concurrent sorting algorithm, radix sort is a distribution sorting algorithm, i.e. both of these algorithms are not usual sorting algorithms. They can be parallelized on GPUs easily to get better performance than other sorting algorithms. We parallelized these sorting algorithms on many core GPUs using the Compute Unified Device Architecture (CUDA) platform, developed by NVIDIA Corporation and got some performance measurements.
Description
AYDIN, Musa/0000-0002-5825-2230
ORCID
Keywords
Graphics Processing Unit, radix sort, bitonic sort, parallel computing, parallel sorting algorithm, CUDA
Turkish CoHE Thesis Center URL
Fields of Science
Citation
7
WoS Q
Scopus Q
Source
10th International Conference on Electronics, Computer and Computation (ICECCO) -- NOV 07-09, 2013 -- Turgut Ozal Univ, Ankara, TURKEY
Volume
Issue
Start Page
326
End Page
329