一个用于Eikonal方程的并行Heap-Cell方法
A parallel Heap-Cell Method for Eikonal equations
AI总结:
本文提出一种并行Heap-Cell方法,用于解决Eikonal方程,展示其在共享内存架构上的高效性和可扩展性,同时探讨数据精度、提前终止准则和硬件架构对性能的影响。
摘要:
大量的Eikonal方程应用推动了多种高效数值算法的发展。Heap-Cell方法(HCM)是一种最近的串行双尺度技术,已被证明在广泛的问题上优于其他串行最先进的求解器。本文提出了一种针对共享内存架构的HCM并行化方法。在$R^3$上的数值实验显示,并行HCM表现出良好的算法行为并具有良好的可扩展性,从而得到一个非常快速且实用的求解器。我们进一步探讨了数据精度、提前终止准则和硬件架构对性能和可扩展性的影响。一篇省略了这些更详细测试的简短手稿已提交至2012年的SIAM期刊《科学计算》。
英文摘要:
Numerous applications of Eikonal equations prompted the development of many efficient numerical algorithms. The Heap-Cell Method (HCM) is a recent serial two-scale technique that has been shown to have advantages over other serial state-of-the-art solvers for a wide range of problems. This paper presents a parallelization of HCM for a shared memory architecture. The numerical experiments in $R^3$ show that the parallel HCM exhibits good algorithmic behavior and scales well, resulting in a very fast and practical solver. We further explore the influence on performance and scaling of data precision, early termination criteria, and the hardware architecture. A shorter version of this manuscript (omitting these more detailed tests) has been submitted to SIAM Journal on Scientific Computing in 2012.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。