SWIFT:多核架构上多分辨率SPH的快速算法
SWIFT: Fast algorithms for multi-resolution SPH on multi-core architectures
摘要:
本文介绍了一种新的方法来寻找邻域光滑粒子流体动力学(SPH)模拟与大的动态范围内的光滑长度。这种方法是基于分层细胞分解,排序的相互作用,和基于任务的制定。它被证明是比传统的基于树的代码更快,比基于域分解的方法在共享内存的并行架构,如多核扩展更好。
英文摘要:
This paper describes a novel approach to neighbour-finding in Smoothed Particle Hydrodynamics (SPH) simulations with large dynamic range in smoothing length. This approach is based on hierarchical cell decompositions, sorted interactions, and a task-based formulation. It is shown to be faster than traditional tree-based codes, and to scale better than domain decomposition-based approaches on shared-memory parallel architectures such as multi-cores.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。