Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
Partitioned parallel radix sort is a parallel radix sort that shortens the execution time by modifying the load balanced radix sort which is known one of the fastest internal sort...
Shin-Jae Lee, Minsoo Jeon, Andrew Sohn, Dongseung ...
To quickly get the median value of any given sequence is very important in many research fields. Some popular sort algorithms are discussed in this paper. Selection sort algorithm...
We live in an era of data explosion that necessitates the discovery of novel out-of-core techniques. The I/O bottleneck has to be dealt with in developing out-of-core methods. The...
This paper considers integer sorting on a RAM. We show that adaptive sorting of a sequence with qn inversions is asymptotically equivalent to multisorting groups of at most q keys...