2004
DOI: 10.1016/j.newast.2003.08.002
|View full text |Cite
|
Sign up to set email alerts
|

GOTPM: a parallel hybrid particle-mesh treecode

Abstract: We describe a parallel, cosmological N-body code based on a hybrid scheme using the particle-mesh (PM) and Barnes-Hut (BH) oct-tree algorithm. We call the algorithm GOTPM for Grid-of-Oct-Trees-Particle-Mesh. The code is parallelized using the Message Passing Interface (MPI) library and is optimized to run on Beowulf clusters as well as symmetric multi-processors. The gravitational potential is determined on a mesh using a standard PM method with particle forces determined through interpolation. The softened PM… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
99
0

Year Published

2004
2004
2017
2017

Publication Types

Select...
9

Relationship

3
6

Authors

Journals

citations
Cited by 93 publications
(100 citation statements)
references
References 25 publications
1
99
0
Order By: Relevance
“…If double precision values require 8 bytes and integers require 4, then a threedimensional simulation on one processor, with either entirely N-body or entirely SPH particles will require 474 or 584 bytes of memory per particle when the leapfrog integrator is used (292 or 368 bytes in single precision), and 522 or 706 bytes per particle when the Runge-Kutta integrator is used (318 or 410 bytes in single precision). In comparison, VINE requires 30%-50% more total memory per particle than the Gadget and GOTPM codes (Springel 2005;Dubinski et al 2003), when they are used in double precision mode. Approximately half of the extra cost is due to fact that VINE includes the quadrupole in the multipole summation of gravity, which requires 96 bytes/ particle to store the quadrupole moments for all nodes.…”
Section: Overview Of the Codementioning
confidence: 99%
“…If double precision values require 8 bytes and integers require 4, then a threedimensional simulation on one processor, with either entirely N-body or entirely SPH particles will require 474 or 584 bytes of memory per particle when the leapfrog integrator is used (292 or 368 bytes in single precision), and 522 or 706 bytes per particle when the Runge-Kutta integrator is used (318 or 410 bytes in single precision). In comparison, VINE requires 30%-50% more total memory per particle than the Gadget and GOTPM codes (Springel 2005;Dubinski et al 2003), when they are used in double precision mode. Approximately half of the extra cost is due to fact that VINE includes the quadrupole in the multipole summation of gravity, which requires 96 bytes/ particle to store the quadrupole moments for all nodes.…”
Section: Overview Of the Codementioning
confidence: 99%
“…The simulation starts at z i = 27 and is evolved to the present epoch with 600 global time steps. The code used for the run is an improved version of the GOTPM code ("Grid-of-OctTrees-Particle-Mesh") originally devised by Dubinski et al (2004); a new procedure has been implemented in order to more accurately describe the particle positions using single precision.…”
Section: The Horizon Run 3 N-body Simulationmentioning
confidence: 99%
“…The simulation is run by a PM+Tree N-body code (Dubinski et al 2004) and has a force resolution of 0.24 h −1 Mpc.…”
Section: N-body Simulationmentioning
confidence: 99%