Hourglass: A Bandwidth-Driven Performance Model for Sorting Algorithms

Hourglass: A Bandwidth-Driven Performance Model for Sorting Algorithms
复制标题

沙漏：带宽驱动的排序算法性能模型

DOI：
--
复制
发表时间：
2014
期刊：
Information Security Conference
影响因子：
--
通讯作者：
F. Petrini
F. Petrini
中科院分区：
--
文献类型：
--
作者：
D. Yoon;F. Petrini

文献摘要

被引文献

相似文献

我们开发了一个带宽驱动的性能模型，称为沙漏排序算法。该模型量化了排序算法固有的主要数据移动，例如访问大型缓冲区和网络通信，并估计了执行时间的下限。我们在领先的高性能IBM架构上使用并行基数排序和合并排序以及多节点样本排序验证了该模型。
We develop a bandwidth-driven performance model referred to as Hourglass for sorting algorithms. The model quantifies dominant data movements inherent to sorting algorithms e.g., accesses to/from large buffers and network communication and estimates a lower-bound execution time. We validate the model with parallel radix sort and merge sort as well as multinode sample sort on leadership high-performance IBM architectures. The model helps better understand the inherent bottlenecks in a sorting algorithm --- the users can leverage this model to optimize software, redesign the algorithm, and/or analyze architectural what-if scenarios to explore innovative designs.