arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1709.00086astro-ph.COcs.CEcs.PF
收藏

Galactos:计算20亿伽伽的各向异性三点关联函数

Galactos: Computing the Anisotropic 3-Point Correlation Function for 2 Billion Galaxies

Brian Friesen, Md. Mostofa Ali Patwary, Brian Austin, Nadathur Satish, Zachary Slepian, Narayanan Sundaram, Deborah Bard, Daniel J Eisenstein, Jack Deslippe, Pradeep Dubey, Prabhat

摘要:

暗能量的本质和完整的引力理论是目前宇宙学面临的两个中心问题。解决这些问题的一个重要工具是三点关联函数(3 PCF),它可以探测星系空间随机分布的偏差。然而,3 PCF强大的计算费用阻碍了其应用于包括数百万到数十亿个星系的天文观测。我们提出了Galactos,一种新的高性能实现,O(N^2)算法,使用负载平衡的k-d树和球谐展开计算各向异性3 PCF。我们的实施针对英特尔至强融核架构进行了优化,充分利用了SIMD并行性、指令和线程并发性以及显著的L1和L2缓存重用,在单个节点上达到峰值性能的39%。Galactos可以扩展到整个Cori系统,在9636个节点上达到9.8PF(峰值)和5.06PF(持续),使得3 PCF可以很容易地计算出可观测宇宙中所有星系的3 PCF。

英文摘要:

The nature of dark energy and the complete theory of gravity are two central questions currently facing cosmology. A vital tool for addressing them is the 3-point correlation function (3PCF), which probes deviations from a spatially random distribution of galaxies. However, the 3PCF's formidable computational expense has prevented its application to astronomical surveys comprising millions to billions of galaxies. We present Galactos, a high-performance implementation of a novel, O(N^2) algorithm that uses a load-balanced k-d tree and spherical harmonic expansions to compute the anisotropic 3PCF. Our implementation is optimized for the Intel Xeon Phi architecture, exploiting SIMD parallelism, instruction and thread concurrency, and significant L1 and L2 cache reuse, reaching 39% of peak performance on a single node. Galactos scales to the full Cori system, achieving 9.8PF (peak) and 5.06PF (sustained) across 9636 nodes, making the 3PCF easily computable for all galaxies in the observable universe.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑