Exploiting the Space Filling Curve Ordering of Particles in the Neighbour Search of Gadget3
Antonio Ragagnin, Nikola Tchipev, Bader Michael, Klaus Dolag, Nicolay Hammer · Advances in parallel computing · 2016
Gadget3 is nowadays one of the most frequently used high performing parallel codes for cosmological hydrodynamical simulations. Recent analyses have shown that the Neighbour Search process of Gadget3 is one of the most time-consuming parts. Thus, a considerable speedup can be expected from improvements of the underlying algorithms.