A Parallel TreePM Code

Details A Parallel TreePM Code A Parallel TreePM Code

2004-05-12

arxiv.org/abs/astro-ph/0405220v1

Astronomy and Astrophysics

Astrophysics

10 pages, two figures

Scientific paper

We present an algorithm for parallelising the TreePM code. We use both functional and domain decompositions. Functional decomposition is used to separate the computation of long range and short range forces, as well as the task of coordinating communications between different components. Short range force calculation is time consuming and benefits from the use of domain decomposition. We have tested the code on a Linux cluster. We get a speedup of 31.4 for 128^3 particle simulation on 33 processors; speedup being better for larger simulations. The time taken for one time step per particle is 6.5 micro seconds for a 256^3 particle simulation on 65 processors, thus a simulation that runs for 4000 time steps takes 5 days on this cluster.

Affiliated with

Also associated with

No associations

Rating

A Parallel TreePM Code does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Parallel TreePM Code, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Parallel TreePM Code will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-535709