CUBE:一种信息优化的并行宇宙学$N$ -体算法
CUBE: An Information-optimized parallel Cosmological $N$-body Algorithm
摘要:
宇宙大尺度结构$N$ -体模拟是超级计算中计算量小、存储量大的问题。大量的存储器通常由存储多于足够的粒子相空间信息的低效方式支配。我们提出了一个新的并行,信息优化,粒子网格为基础的$N$体代码CUBE,其中的信息效率和内存效率提高了近一个数量级。这是通过存储粒子的相对相空间坐标,而不是全局值,并在固定点的格式为1字节轻。剩余的信息由互补的密度和速度场(在存储空间中可以忽略不计)以及粒子的适当排序(没有额外的存储)给出。我们的数值实验表明,这种信息优化的$N$体算法提供了精确的结果内的误差的粒子网格算法。这种存储器与计算比率的显著降低打破了在多核和异构计算系统上扩展和加速大型宇宙学$N$体模拟的瓶颈。
英文摘要:
Cosmological large scale structure $N$-body simulations are computation-light, memory-heavy problems in supercomputing. The considerable amount of memory is usually dominated by an inefficient way of storing more than sufficient phase space information of particles. We present a new parallel, information-optimized, particle-mesh-based $N$-body code CUBE, in which information-efficiency and memory-efficiency are increased by nearly an order of magnitude. This is accomplished by storing particle's relative phase space coordinates instead of global values, and in the format of fixed point as light as 1 byte. The remaining information is given by complementary density and velocity fields (negligible in memory space) and proper ordering of particles (no extra memory). Our numerical experiments show that this information-optimized $N$-body algorithm provides accurate results within the error of the particle-mesh algorithm. This significant lowering of the memory-to-computation ratio breaks the bottleneck of scaling up and speeding up large cosmological $N$-body simulations on multi-core and heterogeneous computing systems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。