4.1 Article

GreeM: Massively Parallel TreePM Code for Large Cosmological N-body Simulations

Journal

PUBLICATIONS OF THE ASTRONOMICAL SOCIETY OF JAPAN
Volume 61, Issue 6, Pages 1319-1330

Publisher

OXFORD UNIV PRESS
DOI: 10.1093/pasj/61.6.1319

Keywords

methods: n-body simulations; cosmology: miscellaneous

Funding

  1. Japan Society for the Promotion of Science (JSPS)
  2. Ministry of Education, Culture, Sports, Science and Technology, Japan

Ask authors/readers for more resources

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 x 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).

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.1
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available