Fast In-Place Sorting with CUDA Based on Bitonic Sort
Fast In-Place Sorting with CUDA Based on Bitonic Sort
复制标题
基于双调排序的 CUDA 快速就地排序
DOI：
10.1007/978-3-642-14390-8_42
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
N. Luttenberger
中科院分区：
文献类型：
--
作者：
H. Peters;Ole Schulz;N. Luttenberger
最先进的图形处理器提供了高处理能力，此外，像CUDA这样的框架提供的gpu的高可编程性增加了它们作为通用计算高性能协处理器的可用性。一般来说，排序在计算机科学中得到了很好的研究，但是（由于gpu的这个新应用领域）需要适合现代gpu架构特征的高性能并行排序算法。
State of the art graphics processors provide high processing power and furthermore, the high programmability of GPUs offered by frameworks like CUDA increases their usability as high-performance coprocessors for general-purpose computing. Sorting is well-investigated in Computer Science in general, but (because of this new field of application for GPUs) there is a demand for high-performance parallel sorting algorithms that fit to the characteristics of modern GPU-architecture.
We present a high-performance in-place implementation of Batcher's bitonic sorting networks for CUDA-enabled GPUs. We adapted bitonic sort for arbitrary input length and assigned compare/exchange-operations to threads in a way that decreases low-performance global-memory access and thereby greatly increases the performance of the implementation.
算法 - ESA 2008，第 16 届欧洲年度研讨会，德国卡尔斯鲁厄，2008 年 9 月 15-17 日。会议记录
DOI：
--
发表时间：
2008
期刊：
Embedded Systems and Applications
影响因子：
--
作者：
A. Lecci;S. Giuliani;M. Tramontana;S. Meini;P. Santicioli;C. Maggi
通讯作者：
C. Maggi