宇宙学模拟的ART
The ART of Cosmological Simulations
摘要:
我们描述了MPI并行化的N体自适应细化树(ART)代码的基本思想。代码使用自适应域分解,其中域的边界(平行六面体)不断移动-具有许多自由度-在搜索最小CPU时间时。每个MPI任务在前一个时间步上花费的实际CPU时间用于调整下一个时间步的边界。对于5^3域的典型分解,边界可能变化的数量为3^{84}。我们描述了两个算法,找到最小的CPU时间的配置与大量的域。我们的代码中的每个MPI任务都解决了N体问题,其中一个域边界之外的大规模物质分布由其他域创建的相对较少的临时大粒子表示。在零级时间步的开始,域产生并交换大粒子。然后,每个域将其所有粒子推进许多小的时间步长。在大步长结束时,域决定在何处放置新边界并重新分布粒子。该方案只需要很少的处理器之间的通信,是非常有效的大型宇宙学模拟。
英文摘要:
We describe the basic ideas of MPI parallelization of the N-body Adaptive Refinement Tree (ART) code. The code uses self-adaptive domain decomposition where boundaries of the domains (parallelepipeds) constantly move -- with many degrees of freedom -- in the search of the minimum of CPU time. The actual CPU time spent by each MPI task on previous time-step is used to adjust boundaries for the next time-step. For a typical decomposition of 5^3 domains, the number of possible changes in boundaries is 3^{84}. We describe two algorithms of finding minimum of CPU time for configurations with a large number of domains. Each MPI task in our code solves the N-body problem where the large-scale distribution of matter outside of the boundaries of a domain is represented by relatively few temporary large particles created by other domains. At the beginning of a zero-level time-step, domains create and exchange large particles. Then each domain advances all its particles for many small time-steps. At the end of the large step, the domains decide where to place new boundaries and re-distribute particles. The scheme requires little communications between processors and is very efficient for large cosmological simulations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。