直方图抽样排序
Histogram Sort with Sampling
摘要:
为了最小化数据移动,最先进的并行排序算法使用基于采样和直方图的技术来在重新分配之前对键进行分区。采样使分区能够使用键的代表性子集来完成,而直方图使给定分区的评估和迭代改进成为可能。我们引入了采样直方图排序(HSS),它结合了采样和迭代直方图,以最小的数据移动和高的实际性能找到高质量的分区。与用于找到这些分区的最知名(最近引入的)算法相比,我们的算法需要的通信少了Θ(log(p)/ log log(p))的因子,并且与样本排序和直方图排序的标准变体相比时少得多。我们提供了一个分布式内存实现的算法,比较其性能,现有的两个实现,并提供了一个简短的应用研究显示新算法的好处。
英文摘要:
To minimize data movement, state-of-the-art parallel sorting algorithms use techniques based on sampling and histogramming to partition keys prior to redistribution. Sampling enables partitioning to be done using a representative subset of the keys, while histogramming enables evaluation and iterative improvement of a given partition. We introduce Histogram sort with sampling (HSS), which combines sampling and iterative histogramming to find high quality partitions with minimal data movement and high practical performance. Compared to the best known (recently introduced) algorithm for finding these partitions, our algorithm requires a factor of Θ(log(p)/ log log(p)) less communication, and substantially less when compared to standard variants of Sample sort and Histogram sort. We provide a distributed memory implementation of the proposed algorithm, compare its performance to two existing implementations, and provide a brief application study showing benefit of the new algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。