分层平台的多级通信最优LU和QR分解
Multilevel communication optimal LU and QR factorizations for hierarchical platforms
摘要:
本文主要研究了两种经典的稠密线性代数算法LU和QR分解在多级层次平台上的性能。我们首先介绍了一个新的模型,称为层次集群平台(HCP),封装的特点,这样的平台。的重点是设置在降低所研究的算法在层次结构的每个级别的通信要求。因此,通信的下限扩展相对于HCP模型。然后,我们介绍了为这些平台量身定制的多级LU和QR算法,并提供了详细的性能分析。我们还提供了一组数值实验和性能预测,证明需要这样的算法在大型平台上。
英文摘要:
This study focuses on the performance of two classical dense linear algebra algorithms, the LU and the QR factorizations, on multilevel hierarchical platforms. We first introduce a new model called Hierarchical Cluster Platform (HCP), encapsulating the characteristics of such platforms. The focus is set on reducing the communication requirements of studied algorithms at each level of the hierarchy. Lower bounds on communications are therefore extended with respect to the HCP model. We then introduce multilevel LU and QR algorithms tailored for those platforms, and provide a detailed performance analysis. We also provide a set of numerical experiments and performance predictions demonstrating the need for such algorithms on large platforms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。