PARAVT:并行Voronoi曲面细分代码
PARAVT: Parallel Voronoi Tessellation code
摘要:
我们提出了一个新的开放源代码的大规模并行计算的Voronoi镶嵌(VT以下)在大数据集。该代码的重点是天体物理的目的,VT密度和邻居被广泛使用。有几个串行Voronoi细分代码,但是没有开源和并行实现可用于处理当前N体模拟和天空调查中的大量粒子/星系。利用Qhull库在MPI和VT下实现了并行化。区域分解考虑了任务之间的一致边界计算,并包括周期性条件。此外,该代码还计算邻居列表、Voronoi密度、Voronoi单元体积、每个粒子的密度梯度以及规则网格上的密度。
英文摘要:
We present a new open source code for massive parallel computation of Voronoi tessellations(VT hereafter) in large data sets. The code is focused for astrophysical purposes where VT densities and neighbors are widely used. There are several serial Voronoi tessellation codes, however no open source and parallel implementations are available to handle the large number of particles/galaxies in current N-body simulations and sky surveys. Parallelization is implemented under MPI and VT using Qhull library. Domain decomposition takes into account consistent boundary computation between tasks, and includes periodic conditions. In addition, the code computes neighbors list, Voronoi density, Voronoi cell volume, density gradient for each particle, and densities on a regular grid.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。