PMFAST: Towards Optimal Parallel PM N-body Codes

Discussion topics for individual codes
Post Reply
User avatar
owlice
Guardian of the Codes
Posts: 1122
Joined: Wed Aug 04, 2004 4:18 pm
Location: Washington, DC

PMFAST: Towards Optimal Parallel PM N-body Codes

Post by owlice » Fri Feb 04, 2011 12:30 pm

[c]PMFAST: Towards Optimal Parallel PM N-body Codes[/c][/b]
Abstract: The parallel PM N-body code PMFAST 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. 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 are available.

Credit: Merz, Hugh; Pen, Ue-Li; Trac, Hy

Site: https://www.cita.utoronto.ca/~merz/pmfast/
http://adsabs.harvard.edu/abs/2005NewA...10..393M

Bibcode: 2011ascl.soft02008M

ID: ascl:1102.008
Last edited by Ada Coda on Sun Sep 16, 2018 9:06 pm, edited 1 time in total.
Reason: Updated code entry.
Code-seeking owl at your service

Post Reply