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

粒子方法的分布式内存并行化证明

Proven Distributed Memory Parallelization of Particle Methods

Johannes Pahlke, Ivo F. Sbalzarini

AI总结:

本文提出并数学证明了粒子方法在分布式内存系统上的并行化方案,证明其与串行实现形式等价,为现有及新并行软件奠定了理论基础。

摘要:

我们为分布式内存计算机系统上的粒子方法提供了一种数学上经过证明的并行化方案。粒子方法是一类通用且广泛使用的算法,用于各种应用的计算机模拟和数值预测,从连续流体动力学和颗粒流(使用诸如光滑粒子流体动力学(SPH)和离散元方法(DEM)等技术),到分子建模中的分子动力学(MD)模拟。粒子方法天然适合在并行计算硬件上实现。然而,迄今为止,关于正确性以及与串行实现等价性的数学证明仅适用于共享内存并行。在此,我们利用粒子方法算法类的形式化定义,为分布式内存计算机提供了一种经过证明的并行化方案。我们证明,对于定义明确的粒子方法类别,这些在分布式内存计算机上并行化的粒子方法在形式上等价于其串行对应方法。值得注意的是,本文分析的并行化方案广为人知且被普遍使用。因此,我们的分析对现有和新的粒子方法并行软件实现具有直接的实际意义,并为它们奠定了坚实的理论基础。

英文摘要:

We provide a mathematically proven parallelization scheme for particle methods on distributed-memory computer systems. Particle methods are a versatile and widely used class of algorithms for computer simulations and numerical predictions in various applications, ranging from continuum fluid dynamics and granular flows, using methods such as Smoothed Particle Hydrodynamics (SPH) and Discrete Element Methods (DEM) to Molecular Dynamics (MD) simulations in molecular modeling. Particle methods naturally lend themselves to implementation on parallel-computing hardware. So far, however, a mathematical proof of correctness and equivalence to sequential implementations was only available for shared-memory parallelism. Here, we leverage a formal definition of the algorithmic class of particle methods to provide a proven parallelization scheme for distributed-memory computers. We prove that these parallelized particle methods on distributed memory computers are formally equivalent to their sequential counterpart for a well-defined class of particle methods. Notably, the here analyzed parallelization scheme is well-known and commonly used. Our analysis is, therefore, of immediate practical relevance to existing and new parallel software implementations of particle methods and places them on solid theoretical grounds.

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

↑