扩展共轭梯度法的性能分析及节点感知通信优化
Performance Analysis and Optimal Node-Aware Communication for Enlarged Conjugate Gradient Methods
摘要:
Krylov方法是求解大型稀疏线性方程组的一种重要方法,但在分布式存储机器上的可扩展性较差。这是由于大量集体通信调用的高同步成本以及低计算工作量。扩大的Krylov方法通过减少收敛的总迭代来解决这个问题,这是分裂初始残差并导致对块向量的操作的伪像。在本文中,我们提出了一个扩大的Krylov方法,扩大共轭向量(ECG)的性能研究,注意到块向量的并行性能的影响。最值得注意的是,我们观察到由于稀疏矩阵块向量乘法内核中的消息更密集,点对点通信的开销增加了。此外,我们提出的模型来分析预期的性能的心电图,以及,激励设计决策。最重要的是,我们引入了一种新的点对点通信方法,基于节点感知的通信技术,提高了该方法的效率。
英文摘要:
Krylov methods are a key way of solving large sparse linear systems of equations, but suffer from poor strong scalabilty on distributed memory machines. This is due to high synchronization costs from large numbers of collective communication calls alongside a low computational workload. Enlarged Krylov methods address this issue by decreasing the total iterations to convergence, an artifact of splitting the initial residual and resulting in operations on block vectors. In this paper, we present a performance study of an Enlarged Krylov Method, Enlarged Conjugate Gradients (ECG), noting the impact of block vectors on parallel performance at scale. Most notably, we observe the increased overhead of point-to-point communication as a result of denser messages in the sparse matrix-block vector multiplication kernel. Additionally, we present models to analyze expected performance of ECG, as well as, motivate design decisions. Most importantly, we introduce a new point-to-point communication approach based on node-aware communication techniques that increases efficiency of the method at scale.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。