arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.00871cs.DCcs.DScs.NAmath.NA
收藏

求解线性方程组三角系统的并行递归算法通信带宽成本分析的重新审视

A Reexamination of the Communication Bandwidth Cost Analysis of A Parallel Recursive Algorithm for Solving Triangular Systems of Linear Equations

Yuan Tang

AI总结:

本文重新审视了Wicky等人关于TRSM通信避免并行算法的带宽成本分析,指出其中存在不一致和计算错误,尤其是在按矩阵维度与处理器数量关系划分三种成本情形时,为该领域后续改进提供依据。

摘要:

本文对Wicky等人题为“Communication-Avoiding Parallel Algorithms for TRSM”的研究论文进行了重新审视。我们重点关注原始工作中提出的通信带宽成本分析,并识别出需要澄清或修订的潜在问题。当前面临的问题是需要解决分析中发现的不一致和计算错误,特别是基于矩阵维度与处理器数量之间关系将成本划分为三种情形的分类方式。我们的发现有助于推动该领域正在进行的讨论,并为进一步改进这一研究方向铺平道路。

英文摘要:

This paper presents a reexamination of the research paper titled "Communication-Avoiding Parallel Algorithms for \proc{TRSM}" by Wicky et al. We focus on the communication bandwidth cost analysis presented in the original work and identify potential issues that require clarification or revision. The problem at hand is the need to address inconsistencies and miscalculations found in the analysis, particularly in the categorization of costs into three scenarios based on the relationship between matrix dimensions and processor count. Our findings contribute to the ongoing discourse in the field and pave the way for further improvements in this area of research.

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

↑