arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1710.04286cs.MS
收藏

推导正确的高性能算法

Deriving Correct High-Performance Algorithms

Devangi N. Parikh, Maggie E. Myers, Robert A. van de Geijn

摘要:

Dijkstra观察到,验证程序的正确性是困难的,并证明了程序的推导与其正确性的证明是答案。我们说明了这种面向目标的方法,将其应用到域的密集线性代数库的分布式内存并行计算机。我们表明,该领域的大部分功能的实现的基础算法可以系统地推导出是正确的。这样做的好处是,可以发现一个操作的整个算法族,从而可以为给定的体系结构选择最佳算法。这种方法非常实用:受其启发的想法已被用于重写密集的线性代数软件栈,从基本线性代数子程序(BLAS)开始,一直延伸到Elemental分布式内存库,以及其间的每一层。本文演示了如何正式的方法和严格的数学技术的正确性影响HPC。

英文摘要:

Dijkstra observed that verifying correctness of a program is difficult and conjectured that derivation of a program hand-in-hand with its proof of correctness was the answer. We illustrate this goal-oriented approach by applying it to the domain of dense linear algebra libraries for distributed memory parallel computers. We show that algorithms that underlie the implementation of most functionality for this domain can be systematically derived to be correct. The benefit is that an entire family of algorithms for an operation is discovered so that the best algorithm for a given architecture can be chosen. This approach is very practical: Ideas inspired by it have been used to rewrite the dense linear algebra software stack starting below the Basic Linear Algebra Subprograms (BLAS) and reaching up through the Elemental distributed memory library, and every level in between. The paper demonstrates how formal methods and rigorous mathematical techniques for correctness impact HPC.

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

↑