GRACOS: Scalable and Load Balanced P3M Cosmological N-body Code

Astronomy and Astrophysics – Astrophysics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

to be submitted to ApJ. S

Scientific paper

We present a parallel implementation of the particle-particle/particle-mesh (P3M) algorithm for distributed memory clusters. The GRACOS (GRAvitational COSmology) code uses a hybrid method for both computation and domain decomposition. Long-range forces are computed using a Fourier transform gravity solver on a regular mesh; the mesh is distributed across parallel processes using a static one-dimensional slab domain decomposition. Short-range forces are computed by direct summation of close pairs; particles are distributed using a dynamic domain decomposition based on a space-filling Hilbert curve. A nearly-optimal method was devised to dynamically repartition the particle distribution so as to maintain load balance even for extremely inhomogeneous mass distributions. Tests using $800^3$ simulations on a 40-processor beowulf cluster showed good load balance and scalability up to 80 processes. We discuss the limits on scalability imposed by communication and extreme clustering and suggest how they may be removed by extending our algorithm to include adaptive mesh refinement.

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

GRACOS: Scalable and Load Balanced P3M Cosmological N-body 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 GRACOS: Scalable and Load Balanced P3M Cosmological N-body Code, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and GRACOS: Scalable and Load Balanced P3M Cosmological N-body Code will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-114428

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