Building halo merger trees from the Q continuum simulation

Esteban Rangel, Nicholas Frontiere, Salman Habib, Katrin Heitmann, Wei-Keng Liao, Ankit Agrawal, Alok Nidhi Choudhary

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 snapshots, and substructure is identified by tracking the »cores» of merging halos - sets of particles near the halo center. Core tracking is performed after creating merger trees and uses the relationships found during tree construction to associate substructures with hosts. The algorithms are implemented with MPI and evaluated on a Cray XK7 supercomputer using up to 16,384 processes on data from HACC, a modern cosmological simulation framework. We present results for creating merger trees from 101 analysis snapshots taken from the Q Continuum, a large volume, high mass resolution, cosmological simulation evolving half a trillion particles.

Original languageEnglish (US)
Title of host publicationProceedings - 24th IEEE International Conference on High Performance Computing, HiPC 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages398-407
Number of pages10
ISBN (Electronic)9781538622933
DOIs
StatePublished - Feb 7 2018
Event24th IEEE International Conference on High Performance Computing, HiPC 2017 - Jaipur, India
Duration: Dec 18 2017Dec 21 2017

Publication series

NameProceedings - 24th IEEE International Conference on High Performance Computing, HiPC 2017
Volume2017-December

Other

Other24th IEEE International Conference on High Performance Computing, HiPC 2017
CountryIndia
CityJaipur
Period12/18/1712/21/17

Fingerprint

Mergers
Merging
Substructure
Continuum
Galaxies
Trees (mathematics)
Supercomputers
Membership functions
Parallel algorithms
Clustering algorithms
Snapshot
Simulation
Simulation Framework
Supercomputer
Membership Function
Parallel Algorithms
Fast Algorithm
Clustering Algorithm
Data analysis
Adjacent

Keywords

  • Cosmological Nbody Simulations
  • Dark Matter Halos
  • Merger Trees

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Modeling and Simulation

Cite this

Rangel, E., Frontiere, N., Habib, S., Heitmann, K., Liao, W-K., Agrawal, A., & Choudhary, A. N. (2018). Building halo merger trees from the Q continuum simulation. In Proceedings - 24th IEEE International Conference on High Performance Computing, HiPC 2017 (pp. 398-407). (Proceedings - 24th IEEE International Conference on High Performance Computing, HiPC 2017; Vol. 2017-December). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/HiPC.2017.00052
Rangel, Esteban ; Frontiere, Nicholas ; Habib, Salman ; Heitmann, Katrin ; Liao, Wei-Keng ; Agrawal, Ankit ; Choudhary, Alok Nidhi. / Building halo merger trees from the Q continuum simulation. Proceedings - 24th IEEE International Conference on High Performance Computing, HiPC 2017. Institute of Electrical and Electronics Engineers Inc., 2018. pp. 398-407 (Proceedings - 24th IEEE International Conference on High Performance Computing, HiPC 2017).
@inproceedings{6b138ceea5cd413987d0d99469e2675a,
title = "Building halo merger trees from the Q continuum simulation",
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 snapshots, and substructure is identified by tracking the »cores» of merging halos - sets of particles near the halo center. Core tracking is performed after creating merger trees and uses the relationships found during tree construction to associate substructures with hosts. The algorithms are implemented with MPI and evaluated on a Cray XK7 supercomputer using up to 16,384 processes on data from HACC, a modern cosmological simulation framework. We present results for creating merger trees from 101 analysis snapshots taken from the Q Continuum, a large volume, high mass resolution, cosmological simulation evolving half a trillion particles.",
keywords = "Cosmological Nbody Simulations, Dark Matter Halos, Merger Trees",
author = "Esteban Rangel and Nicholas Frontiere and Salman Habib and Katrin Heitmann and Wei-Keng Liao and Ankit Agrawal and Choudhary, {Alok Nidhi}",
year = "2018",
month = "2",
day = "7",
doi = "10.1109/HiPC.2017.00052",
language = "English (US)",
series = "Proceedings - 24th IEEE International Conference on High Performance Computing, HiPC 2017",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "398--407",
booktitle = "Proceedings - 24th IEEE International Conference on High Performance Computing, HiPC 2017",
address = "United States",

}

Rangel, E, Frontiere, N, Habib, S, Heitmann, K, Liao, W-K, Agrawal, A & Choudhary, AN 2018, Building halo merger trees from the Q continuum simulation. in Proceedings - 24th IEEE International Conference on High Performance Computing, HiPC 2017. Proceedings - 24th IEEE International Conference on High Performance Computing, HiPC 2017, vol. 2017-December, Institute of Electrical and Electronics Engineers Inc., pp. 398-407, 24th IEEE International Conference on High Performance Computing, HiPC 2017, Jaipur, India, 12/18/17. https://doi.org/10.1109/HiPC.2017.00052

Building halo merger trees from the Q continuum simulation. / Rangel, Esteban; Frontiere, Nicholas; Habib, Salman; Heitmann, Katrin; Liao, Wei-Keng; Agrawal, Ankit; Choudhary, Alok Nidhi.

Proceedings - 24th IEEE International Conference on High Performance Computing, HiPC 2017. Institute of Electrical and Electronics Engineers Inc., 2018. p. 398-407 (Proceedings - 24th IEEE International Conference on High Performance Computing, HiPC 2017; Vol. 2017-December).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Building halo merger trees from the Q continuum simulation

AU - Rangel, Esteban

AU - Frontiere, Nicholas

AU - Habib, Salman

AU - Heitmann, Katrin

AU - Liao, Wei-Keng

AU - Agrawal, Ankit

AU - Choudhary, Alok Nidhi

PY - 2018/2/7

Y1 - 2018/2/7

N2 - 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 snapshots, and substructure is identified by tracking the »cores» of merging halos - sets of particles near the halo center. Core tracking is performed after creating merger trees and uses the relationships found during tree construction to associate substructures with hosts. The algorithms are implemented with MPI and evaluated on a Cray XK7 supercomputer using up to 16,384 processes on data from HACC, a modern cosmological simulation framework. We present results for creating merger trees from 101 analysis snapshots taken from the Q Continuum, a large volume, high mass resolution, cosmological simulation evolving half a trillion particles.

AB - 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 snapshots, and substructure is identified by tracking the »cores» of merging halos - sets of particles near the halo center. Core tracking is performed after creating merger trees and uses the relationships found during tree construction to associate substructures with hosts. The algorithms are implemented with MPI and evaluated on a Cray XK7 supercomputer using up to 16,384 processes on data from HACC, a modern cosmological simulation framework. We present results for creating merger trees from 101 analysis snapshots taken from the Q Continuum, a large volume, high mass resolution, cosmological simulation evolving half a trillion particles.

KW - Cosmological Nbody Simulations

KW - Dark Matter Halos

KW - Merger Trees

UR - http://www.scopus.com/inward/record.url?scp=85050397574&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85050397574&partnerID=8YFLogxK

U2 - 10.1109/HiPC.2017.00052

DO - 10.1109/HiPC.2017.00052

M3 - Conference contribution

T3 - Proceedings - 24th IEEE International Conference on High Performance Computing, HiPC 2017

SP - 398

EP - 407

BT - Proceedings - 24th IEEE International Conference on High Performance Computing, HiPC 2017

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Rangel E, Frontiere N, Habib S, Heitmann K, Liao W-K, Agrawal A et al. Building halo merger trees from the Q continuum simulation. In Proceedings - 24th IEEE International Conference on High Performance Computing, HiPC 2017. Institute of Electrical and Electronics Engineers Inc. 2018. p. 398-407. (Proceedings - 24th IEEE International Conference on High Performance Computing, HiPC 2017). https://doi.org/10.1109/HiPC.2017.00052