Yildiz, ZehraAydin, MusaYilmaz, Guray2024-10-152024-10-15201379781479933433[WOS-DOI-BELIRLENECEK-201]https://hdl.handle.net/20.500.14517/6352AYDIN, Musa/0000-0002-5825-2230Data 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.eninfo:eu-repo/semantics/closedAccessGraphics Processing Unitradix sortbitonic sortparallel computingparallel sorting algorithmCUDAConference Object326329WOS:000336616500082