arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1612.02557cs.DScs.PF
收藏

使用RADULS对超大规模数据进行排序。基数排序的新体现

Sorting Data on Ultra-Large Scale with RADULS. New Incarnation of Radix Sort

Marek Kokot, Sebastian Deorowicz, Agnieszka Debudaj-Grabysz

摘要:

本文介绍了一种基于基数排序算法的并行排序器RADULS,它可以有效地组织超大型数据集。例如,在基于Intel Xeon的工作站上,可以使用16个线程在不到15秒的时间内对4G 16字节记录进行排序。RADULS的实现不仅经过高度优化以获得如此出色的性能,而且还以高速缓存友好的方式并行化以充分利用现代多核架构。此外,我们的并行调度程序在运行时启动几个不同的过程,根据当前的执行参数,适当的工作负载管理。所有的实验表明,RADULS是优于竞争算法。

英文摘要:

The paper introduces RADULS, a new parallel sorter based on radix sort algorithm, intended to organize ultra-large data sets efficiently. For example 4G 16-byte records can be sorted with 16 threads in less than 15 seconds on Intel Xeon-based workstation. The implementation of RADULS is not only highly optimized to gain such an excellent performance, but also parallelized in a cache friendly manner to make the most of modern multicore architectures. Besides, our parallel scheduler launches a few different procedures at runtime, according to the current parameters of the execution, for proper workload management. All experiments show RADULS to be superior to competing algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑