Sorting data is an important problem for many applications. Parallel sorting is a way to
improve sorting performance using more nodes or threads eg dividing data in more nodes …

Sorting is a well interrogating issue in computer science. Many authors have invented
numerous sorting algorithms on CPU (Central Processing Unit). In today's life sorting on the …

This paper describe a parallel sorting algorithm which is the combination of counting sort
and ternary search. The proposed algorithm is based on split and concurrent selection …

Parallel sorting algorithms are widely studied nowadays. After the introduction of parallel
processors such as graphics processing unit (GPU) and easy to use parallel programming …

The sorting algorithms problem is probably one of the most famous problems that used in
abroad variety of application. There are many techniques to solve the sorting problem. In this …

Sorting algorithms have been studied for more than 3 decades now. The aim of this paper is
to implement some of the sorting algorithms using the CUDA language in a GPU …

Sorting is one of the fundamental problems in computer science. With the proliferation of
multi core processors, parallel algorithms for sorting have become very important. In this …

This paper presents a short survey and performance analysis of parallel sorting algorithms
on graphics processing units. Three implementations of the representative sorting …

Sorting is one of a classic problem in computer engineer. One well-known sorting algorithm
is a Counting Sort algorithm. Counting Sort had one problem, it can't sort a positive and …

This paper presents a new sorting algorithm called RAMI-Sort algorithm. The RAMI-Sort
algorithm enhanced the time complexity of the best, average, and worst cases of many …