Building Halo Merger Trees from the Q Continuum Simulation
Esteban Rangel, Nicholas Frontiere, Salman Habib, Katrin Heitmann,, Wei-keng Liao, Ankit Agrawal, Alok Choudhary

TL;DR
This paper introduces fast parallel algorithms for constructing halo merger trees and tracking substructures from large cosmological N-body simulations, enabling detailed analysis of galaxy formation histories.
Contribution
The authors develop and implement efficient MPI-based algorithms to generate halo merger trees and substructure tracking from large simulation datasets, improving analysis speed and scalability.
Findings
Algorithms successfully processed data from the Q Continuum simulation
Achieved scalable performance on up to 16,384 processes
Produced detailed merger trees and substructure information
Abstract
Cosmological N-body simulations rank among the most computationally intensive efforts today. A key challenge is the analysis of structure, substructure, and the merger history for many billions of compact particle clusters, called halos. Effectively representing the merging history of halos is essential for many galaxy formation models used to generate synthetic sky catalogs, an important application of modern cosmological simulations. Generating realistic mock catalogs requires computing the halo formation history from simulations with large volumes and billions of halos over many time steps, taking hundreds of terabytes of analysis data. We present fast parallel algorithms for producing halo merger trees and tracking halo substructure from a single-level, density-based clustering algorithm. Merger trees are created from analyzing the halo-particle membership function in adjacent…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
