arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.03933math.NAcs.CEcs.NAcs.PF
收藏

面向mortar有限元方法的可扩展计算核

Scalable computational kernels for mortar finite element methods

Matthias Mayr, Alexander Popp

AI总结:

针对mortar有限元方法中mortar积分计算成本高、并行可扩展性差的问题,提出基于界面重叠区域分解和几何驱动ghost数据约简的计算策略,首次在动态演化接触的mortar问题中实现动态负载平衡,验证了480进程下的强、弱可扩展性。

摘要:

针对并行硬件架构上的仿真需求,本文提出了用于mortar有限元方法高效计算的计算核。Mortar方法能够以高精度实现变分一致的耦合条件施加,但计算耦合算子所需的mortar积分评估会带来巨大的数值计算量与成本。本文指出了并行数据布局与区域分解中阻碍mortar积分高效评估的瓶颈,随后提出了一套计算策略,为专用于mortar项评估的核心核恢复最优并行通信与可扩展性。我们以三维大变形接触力学为背景,针对界面拓扑固定和动态变化两种情况对所提算法组件进行了示例研究,不过这些概念可以自然且轻松地迁移到其他mortar应用中,例如经典的网格绑定(meshtying)问题。为恢复并行可扩展性,我们采用了独立于底层体网格的界面离散重叠区域分解方法,随后通过几何驱动的 ghost 数据约简来处理mortar评估的并行通信问题。借助三维接触算例,我们验证了所提算法在最多480个并行进程下的强可扩展性与弱可扩展性,并研究和讨论了mortar有限元方法相关的并行通信改进。本文首次将动态负载平衡应用于接触区不断演化的mortar接触问题,使得计算工作量在所有并行处理器间实现良好均衡,且不受仿真当前状态的影响。

英文摘要:

Targeting simulations on parallel hardware architectures, this paper presents computational kernels for efficient computations in mortar finite element methods. Mortar methods enable a variationally consistent imposition of coupling conditions at high accuracy, but come with considerable numerical effort and cost for the evaluation of the mortar integrals to compute the coupling operators. In this paper, we identify bottlenecks in parallel data layout and domain decomposition that hinder an efficient evaluation of the mortar integrals. We then propose a set of computational strategies to restore optimal parallel communication and scalability for the core kernels devoted to the evaluation of mortar terms. We exemplarily study the proposed algorithmic components in the context of three-dimensional large-deformation contact mechanics, both for cases with fixed and dynamically varying interface topology, yet these concepts can naturally and easily be transferred to other mortar applications, e.g. classical meshtying problems. To restore parallel scalability, we employ overlapping domain decompositions of the interface discretization independent from the underlying volumes and then tackle parallel communication for the mortar evaluation by a geometrically motivated reduction of ghosting data. Using three-dimensional contact examples, we demonstrate strong and weak scalability of the proposed algorithms up to 480 parallel processes as well as study and discuss improvements in parallel communication related to mortar finite element methods. For the first time, dynamic load balancing is applied to mortar contact problems with evolving contact zones, such that the computational work is well balanced among all parallel processors independent of the current state of the simulation.

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

↑