GreeM : Massively Parallel TreePM Code for Large Cosmological N-body Simulations
Abstract
In this paper, we describe the implementation and performance of GreeM, a massively parallel TreePM code for large-scale cosmological N-body simulations. GreeM uses a recursive multi-section algorithm for domain decomposition. The size of the domains are adjusted so that the total calculation time of the force becomes the same for all processes. The loss of performance due to non-optimal load balancing is around 4%, even for more than 10^3 CPU cores. GreeM runs efficiently on PC clusters and massively-parallel computers such as a Cray XT4. The measured calculation speed on Cray XT4 is 5 \times 10^4 particles per second per CPU core, for the case of an opening angle of \theta=0.5, if the number of particles per CPU core is larger than 10^6.
Cite
@article{arxiv.0910.0121,
title = {GreeM : Massively Parallel TreePM Code for Large Cosmological N-body Simulations},
author = {Tomoaki Ishiyama and Toshiyuki Fukushige and Junichiro Makino},
journal= {arXiv preprint arXiv:0910.0121},
year = {2015}
}
Comments
13 pages, 11 figures, accepted by PASJ