2 HOT：一种改进的并行Hashed八叉树N-Body算法
2HOT: An Improved Parallel Hashed Oct-Tree N-Body Algorithm for Cosmological Simulation
摘要：
我们报告在过去的二十年中，我们的自适应树码N-体方法（HOT）的改进。描述了宇宙学N体问题的数学和计算方法，其性能和可扩展性测量到256 k（$2^{18}$）处理器。我们目前的误差分析和科学应用的结果，从一系列超过10个69亿（$4096^3$）粒子宇宙学模拟，占$4 \times 10^{20}$浮点运算。这些结果包括使用普朗克卫星宇宙学标准模型的新约束的第一次模拟。我们的模拟为准确性和科学吞吐量设定了新的标准，同时达到或超过了最新一代混合TreePM N-body方法的计算效率。
英文摘要：
We report on improvements made over the past two decades to our adaptive treecode N-body method (HOT). A mathematical and computational approach to the cosmological N-body problem is described, with performance and scalability measured up to 256k ($2^{18}$) processors. We present error analysis and scientific application results from a series of more than ten 69 billion ($4096^3$) particle cosmological simulations, accounting for $4 \times 10^{20}$ floating point operations. These results include the first simulations using the new constraints on the standard model of cosmology from the Planck satellite. Our simulations set a new standard for accuracy and scientific throughput, while meeting or exceeding the computational efficiency of the latest generation of hybrid TreePM N-body methods.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
