GPU样本排序
GPU sample sort
摘要:
在本文中,我们提出了一个示例排序算法的设计,为众核GPU。尽管是分布式内存架构中最有效的基于比较的排序算法之一,但它在GPU上的性能以前是未知的。对于均匀分布的键,我们的样本排序比最好的基于比较的排序算法GPU Thrust merge sort至少快25%,平均快68%,平均比GPU quicksort快2倍以上。此外,对于64位整数键,它至少比直接操作键的二进制表示的高度优化的GPU推力基数排序快63%,平均快2倍。我们的实现对不同的密钥分布和熵水平具有鲁棒性,并且几乎与输入大小呈线性关系。这些结果表明,多路技术,特别是样本排序,实现了更好的性能比双向归并排序和快速排序。
英文摘要:
In this paper, we present the design of a sample sort algorithm for manycore GPUs. Despite being one of the most efficient comparison-based sorting algorithms for distributed memory architectures its performance on GPUs was previously unknown. For uniformly distributed keys our sample sort is at least 25% and on average 68% faster than the best comparison-based sorting algorithm, GPU Thrust merge sort, and on average more than 2 times faster than GPU quicksort. Moreover, for 64-bit integer keys it is at least 63% and on average 2 times faster than the highly optimized GPU Thrust radix sort that directly manipulates the binary representation of keys. Our implementation is robust to different distributions and entropy levels of keys and scales almost linearly with the input size. These results indicate that multi-way techniques in general and sample sort in particular achieve substantially better performance than two-way merge sort and quicksort.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。