arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1406.7808math.NAcs.NA
收藏

分段细化:一种用于数据局部性的多网格技术

Segmental Refinement: A Multigrid Technique for Data Locality

Lawrence Berkeley National Laboratory(劳伦斯伯克利国家实验室);Argonne National Laboratory(阿贡国家实验室);University of Chicago(芝加哥大学);King Abdullah University of Science and Technology(阿卜杜拉国王科技大学)

Mark F. Adams, Jed Brown, Matt Knepley, Ravi Samtaney

AI总结:

本文提出分段细化技术,通过分析和实验研究其复杂性,证明在细网格上可通过少量额外工作和存储消除传统并行多网格的通信,同时保持全多网格的渐近精确性。

摘要:

我们研究了一种域分解的多网格技术,即分段细化,用于求解一般的非线性椭圆边值问题。Brandt和Diskin于1994年首次提出此方法;我们继续这项工作,通过分析和实验研究其复杂性。我们确认,在细网格上可通过少量额外工作和存储消除传统并行多网格的通信,同时保持全多网格的渐近精确性,尽管我们观察到一个未在原始分析中考虑的额外参数的依赖性。我们提出了一种通信复杂性分析,量化了分段细化所减少的通信成本,并报告了使用64K核心Cray XC30的性能结果。

英文摘要:

We investigate a domain decomposed multigrid technique, segmental refinement, for solving general nonlinear elliptic boundary value problems. Brandt and Diskin first proposed this method in 1994; we continue this work by analytically and experimentally investigating its complexity. We confirm that communication of traditional parallel multigrid can be eliminated on fine grids with modest amounts of extra work and storage while maintaining the asymptotic exactness of full multigrid, although we observe a dependence on an additional parameter not considered in the original analysis. We present a communication complexity analysis that quantifies the communication costs ameliorated by segmental refinement and report performance results with up to 64K cores of a Cray XC30.

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

↑