Search

We describe a new method (\textsc{CompaSO}) for identifying groups of particles in cosmological $N$-body simulations. \textsc{CompaSO} builds upon existing spherical overdensity (SO) algorithms by taking into consideration the tidal radius around a smaller halo before competitively assigning halo membership to the particles. In this way, the \textsc{CompaSO} finder allows for more effective deblending of haloes in close proximity as well as the formation of new haloes on the outskirts of larger ones. This halo-finding algorithm is used in the \textsc{AbacusSummit} suite of $N$-body simulations, designed to meet the cosmological simulation requirements of the Dark Energy Spectroscopic Instrument (DESI) survey. \textsc{CompaSO} is developed as a highly efficient on-the-fly group finder, which is crucial for enabling good load-balancing between the GPU and CPU and the creation of high-resolution merger trees. In this paper, we describe the halo-finding procedure and its particular implementation in \Abacus{Abacus}, accompanying it with a qualitative analysis of the finder. {We test the robustness of the \textsc{CompaSO} catalogues before and after applying the cleaning method described in an accompanying paper and demonstrate its effectiveness by comparing it with other validation techniques.} We then visualise the haloes and their density profiles, finding that they are well fit by the NFW formalism. Finally, we compare other properties such as radius-mass relationships and two-point correlation functions with that of another widely used halo finder, \textsc{ROCKSTAR}., Comment: 22 pages, 12 figures, appendices, accepted in MNRAS

We present the public data release of the AbacusSummit cosmological $N$-body simulation suite, produced with the $\texttt{Abacus}$ $N$-body code on the Summit supercomputer of the Oak Ridge Leadership Computing Facility. $\texttt{Abacus}$ achieves $\mathcal{O}\left(10^{-5}\right)$ median fractional force error at superlative speeds, calculating 70M particle updates per second per node at early times, and 45M particle updates per second per node at late times. The simulation suite totals roughly 60 trillion particles, the core of which is a set of 139 simulations with particle mass $2\times10^{9}\,h^{-1}\mathrm{M}_\odot$ in box size $2\,h^{-1}\mathrm{Gpc}$. The suite spans 97 cosmological models, including Planck 2018, previous flagship simulation cosmologies, and a linear derivative and cosmic emulator grid. A sub-suite of 1883 boxes of size $500\,h^{-1}\mathrm{Mpc}$ is available for covariance estimation. AbacusSummit data products span 33 epochs from $z=8$ to $0.1$ and include lightcones, full particle snapshots, halo catalogs, and particle subsets sampled consistently across redshift. AbacusSummit is the largest high-accuracy cosmological $N$-body data set produced to date., Comment: 30 pages, 10 figures, 6 tables. Published in MNRAS. Data available at https://abacusnbody.org and https://abacussummit.readthedocs.io/en/latest/data-access.html (DOI: 10.13139/OLCF/1811689)

We present $\texttt{Abacus}$, a fast and accurate cosmological $N$-body code based on a new method for calculating the gravitational potential from a static multipole mesh. The method analytically separates the near- and far-field forces, reducing the former to direct $1/r^2$ summation and the latter to a discrete convolution over multipoles. The method achieves 70 million particle updates per second per node of the Summit supercomputer, while maintaining a median fractional force error of $10^{-5}$. We express the simulation time step as an event-driven "pipeline", incorporating asynchronous events such as completion of co-processor work, Input/Output, and network communication. $\texttt{Abacus}$ has been used to produce the largest suite of $N$-body simulations to date, the $\texttt{AbacusSummit}$ suite of 60 trillion particles (Maksimova et al., 2021), incorporating on-the-fly halo finding. $\texttt{Abacus}$ enables the production of mock catalogs of the volume and resolution required by the coming generation of cosmological surveys., Comment: 29 pages, 19 figures. Published in MNRAS

We present the checkpointing scheme of Abacus, an $N$-body simulation code that allocates all persistent state in POSIX shared memory, or ramdisk. Checkpointing becomes as simple as copying files from ramdisk to external storage. The main simulation executable is invoked once per time step, memory mapping the input state, computing the output state directly into ramdisk, and unmapping the input state. The main executable remains unaware of the concept of checkpointing, with the top-level driver code launching a file-system copy between executable invocations when a checkpoint is needed. Since the only information flow is through files on ramdisk, the checkpoint must be correct so long as the simulation is correct. However, we find that with multi-GB of state, there is a significant overhead to unmapping the shared memory. This can be partially mitigated with multithreading, but ultimately, we do not recommend shared memory for use with a large state., Comment: 3 pages, 1 figure. Extended abstract accepted by SuperCheck21. Symposium presentation at https://drive.google.com/file/d/1q63kk1TCyOuh15Lu47bUJ8K7iZ-pYP9U/view