PMFAST: Towards Optimal Parallel PM N-body Codes

Astronomy and Astrophysics – Astrophysics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We present a new parallel PM N-body code named PMFAST that is cost-effective and memory-efficient. PMFAST is based on a two-level mesh gravity solver where the gravitational forces are separated into long and short range components. The decomposition scheme minimizes communication costs and allows tolerance for slow networks. The code approaches optimality in several dimensions. The force computations are local and exploit highly optimized vendor FFT libraries. It features minimal memory overhead, with the particle positions and velocities being the main cost. The code features support for distributed and shared memory parallelization through the use of MPI and OpenMP, respectively. The current release version uses two grid levels on a slab decomposition, with periodic boundary conditions for cosmological applications. Open boundary conditions could be added with little computational overhead. We present timing information and results from a recent cosmological production run of the code using a 3712^3 mesh with 6.4 x 10^9 particles.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

PMFAST: Towards Optimal Parallel PM N-body Codes 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 PMFAST: Towards Optimal Parallel PM N-body Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and PMFAST: Towards Optimal Parallel PM N-body Codes will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-1117086

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.