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

算法979:稠密线性代数的递归算法--ReLAPACK集

Algorithm 979: Recursive Algorithms for Dense Linear Algebra -- The ReLAPACK Collection

Elmar Peise, Paolo Bientinesi

摘要:

为了利用高度调优内核的内存局部性和全部性能潜力,密集线性代数库(如LAPACK)通常将操作实现为分块算法。然而,为了用这样的算法实现次优性能,需要显著的调优。另一方面,递归算法实际上是无调优的,但仍能获得类似的性能。在本文中,我们首先分析和比较阻塞和递归算法的性能,然后介绍ReLAPACK,递归算法的开源库,无缝地取代大多数LAPACK的阻塞算法。在许多情况下,ReLAPACK明显优于参考LAPACK,甚至提高了优化库的性能。

英文摘要:

To exploit both memory locality and the full performance potential of highly tuned kernels, dense linear algebra libraries such as LAPACK commonly implement operations as blocked algorithms. However, to achieve next-to-optimal performance with such algorithms, significant tuning is required. On the other hand, recursive algorithms are virtually tuning free, and yet attain similar performance. In this paper, we first analyze and compare blocked and recursive algorithms in terms of performance, and then introduce ReLAPACK, an open-source library of recursive algorithms to seamlessly replace most of LAPACK's blocked algorithms. In many scenarios, ReLAPACK clearly outperforms reference LAPACK, and even improves upon the performance of optimizes libraries.

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

↑