格子动力学蒙特卡洛中的并行化、处理器通信与误差分析
Parallelization, processor communication and error analysis in lattice kinetic Monte Carlo
AI总结:
本文从数值分析角度研究分数步动力学蒙特卡洛(FS-KMC)算法,通过目标导向的误差分析,揭示处理器通信与部分异步性对并行模拟精度的影响。
摘要:
本文从数值分析角度研究了文献[1]中提出的分数步动力学蒙特卡洛(FS-KMC)算法,用于格子空间分布粒子系统的并行模拟。FS-KMC是分数步算法,具有时间步长窗口$\Delta t$,因此在$\Delta t$期间没有处理器通信,本质上是部分异步的。本文主要关注FS-KMC算法作为传统串行动力学蒙特卡洛(KMC)近似的误差分析。我们分析的一个关键方面在于强调对适当定义的宏观可观测量(如密度、能量、相关性、表面粗糙度)采用目标导向的方法,而不是关注单个轨迹的强拓扑估计。误差分析的一个关键意义是,它使我们能够通过比较不同并行策略的(部分)异步性来系统地处理KMC的处理器通信问题,而异步性又由给定误差容限下各自的分数时间步$\Delta t$来衡量。
英文摘要:
In this paper we study from a numerical analysis perspective the Fractional Step Kinetic Monte Carlo (FS-KMC) algorithms proposed in [1] for the parallel simulation of spatially distributed particle systems on a lattice. FS-KMC are fractional step algorithms with a time-stepping window $Δt$, and as such they are inherently partially asynchronous since there is no processor communication during the period $Δt$. In this contribution we primarily focus on the error analysis of FS-KMC algorithms as approximations of conventional, serial kinetic Monte Carlo (KMC). A key aspect of our analysis relies on emphasising a goal-oriented approach for suitably defined macroscopic observables (e.g., density, energy, correlations, surface roughness), rather than focusing on strong topology estimates for individual trajectories. One of the key implications of our error analysis is that it allows us to address systematically the processor communication of different parallelization strategies for KMC by comparing their (partial) asynchrony, which in turn is measured by their respective fractional time step $Δt$ for a prescribed error tolerance.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。