GPU-ABiSort: optimal parallel sorting on stream architectures. In this paper, we present a novel approach for parallel sorting on stream processing architectures. It is based on adaptive bitonic sorting. For sorting n values utilizing p stream processor units, this approach achieves the optimal time complexity O((n log n)/p). While this makes our approach competitive with common sequential sorting algorithms not only from a theoretical viewpoint, it is also very fast from a practical viewpoint. This is achieved by using efficient linear stream memory accesses (and by combining the optimal time approach with algorithms optimized for small input sequences). We present an implementation on modern programmable graphics hardware (GPUs). On GPUs, our optimal parallel sorting approach has shown to be remarkably faster than sequential sorting on the CPU, and it is also faster than previous non-optimal sorting approaches on the GPU for sufficiently large input sequences. Because of the excellent scalability of our algorithm with the number of stream processor units p (up to n/log/sup 2/ n or even n/log n units, depending on the stream architecture), our approach profits heavily from the trend of increasing number of fragment processor units on GPUs, so that we can expect further speed improvement with upcoming GPU generations.
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Codish, Michael; Cruz-Filipe, Luís; Nebel, Markus; Schneider-Kamp, Peter: Optimizing sorting algorithms by using sorting networks (2017)
- Dehne, Frank; Zaboli, Hamidreza: Parallel sorting for GPUs (2017)
- Lin, Yu-Te; Chen, Peng-Sheng: Compiler support for general-purpose computation on GPUs (2009) ioport
- Sintorn, Erik; Assarsson, Ulf: Fast parallel GPU-sorting using a hybrid algorithm (2008)