Performance Enhancement of Tree-based Friends-of-friends Galaxy Finder for High-resolution Simulations of Galaxy Formation

Abstract

Cosmological simulations are useful tools for studying the evolution of galaxies, and it is critical to accurately identify galaxies and their halos from raw simulation data. The friends-of-friends (FoF) algorithm has been widely adopted for this purpose because of its simplicity and expandability to higher dimensions. However, it is cost-inefficient when applied to high-resolution simulations because standard FoF implementation leads to too many distance calculations in dense regions. We confirm this through our exercise of applying the six-dimensional (6D) FoF galaxy finder code, VELOCI raptor , on the N ew H orizon simulation. The high particle resolution of N ew H orizon ( M star ∼ 10 4 M ⊙ ) allows a large central number density (10 6 kpc −3 ) for typical galaxies, resulting in a few days to weeks of galaxy searches for just one snapshot. Even worse, we observed a significant decrease in the FoF performance in the high-dimensional 6D searches: “the curse of dimensionality” problem. To overcome these issues, we have developed several implementations that can be readily applied to any tree-based FoF code. They include limiting visits to tree nodes, reordering the list of particles for searching neighbor particles, and altering the tree structure. Compared to the run with the original code, the new run with these implementations results in the identical galaxy detection with the ideal performance, O ( N log N ) , N being the number of particles in a galaxy—with a speed gain of a factor of 2700 in 3D or 12 in a 6D FoF search.