Cornerstone:面向可扩展粒子模拟的八叉树构建算法
Cornerstone: Octree Construction Algorithms for Scalable Particle Simulations
AI总结:
本文提出可在分布式 HPC 与全 GPU 环境运行的 Cornerstone 八叉树构建方法,支持 Barnes-Hut/FMM 粒子模拟,并在 LUMI-G 上扩展至 8 万亿粒子。
摘要:
本文提出了一种名为 Cornerstone 的八叉树构建方法,用于支持无网格数值模拟中的全局域分解和粒子间相互作用。该方法基于为三维计算机图形学开发的算法,并将其扩展到分布式高性能计算(HPC)系统。Cornerstone 可生成全局八叉树和局部必要八叉树,并能够并行处理树层次结构的所有层级。所得八叉树适合支持 N-body 方法中各类短程和长程相互作用的计算,例如 Barnes-Hut 和快速多极子方法(FMM)。虽然我们提供了 CPU 实现,但 Cornerstone 也可以完全运行在 GPU 上。与在 CPU 上执行相比,这会显著加快树构建速度,并为设计超越卸载模式的模拟代码提供强大构建块;在卸载模式下,只有数值密集型任务会被分派到 GPU。由于数据完全驻留在 GPU 内存中,Cornerstone 消除了 CPU 与 GPU 之间的数据移动。作为示例,我们使用 Cornerstone 为 Barnes-Hut treecode 生成局部必要八叉树,该代码运行在几乎整个 LUMI-G 系统上,粒子数多达 8 万亿。
英文摘要:
This paper presents an octree construction method, called Cornerstone, that facilitates global domain decomposition and interactions between particles in mesh-free numerical simulations. Our method is based on algorithms developed for 3D computer graphics, which we extend to distributed high performance computing (HPC) systems. Cornerstone yields global and locally essential octrees and is able to operate on all levels of tree hierarchies in parallel. The resulting octrees are suitable for supporting the computation of various kinds of short and long range interactions in N-body methods, such as Barnes-Hut and the Fast Multipole Method (FMM). While we provide a CPU implementation, Cornerstone may run entirely on GPUs. This results in significantly faster tree construction compared to execution on CPUs and serves as a powerful building block for the design of simulation codes that move beyond an offloading approach, where only numerically intensive tasks are dispatched to GPUs. With data residing exclusively in GPU memory, Cornerstone eliminates data movements between CPUs and GPUs. As an example, we employ Cornerstone to generate locally essential octrees for a Barnes-Hut treecode running on almost the full LUMI-G system with up to 8 trillion particles.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。