Capanic: A Parallel Tree N-Body Code for Inhomogeneous Clusters of Processors

Astronomy and Astrophysics – Astrophysics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

8 Pages, LaTex + 3 figures available by anonymous ftp at convex.ct.astro.it, /nbody/paper1/figures.ps. Presented at MPCS '94,

Scientific paper

We have implemented a parallel version of the Barnes-Hut 3-D N-body tree algorithm under PVM 3.2.5, adopting an SPMD paradigm. We parallelize the problem by decomposing the physical domain by means of the {\bf Orthogonal Recursive Bisection} oct-tree scheme suggested by Salmon (1991), but we modify the original hypercube communication pattern into an incomplete hypercube, which is more suitable for a generic inhomogenous cluster architecture.\\ We address dynamical load balancing by assigning different "weights" to the spawned tasks according to the dynamically changing workloads of each task. The weights are determined by monitoring the local platforms where the tasks are running and estimating the performance of each task. The monitoring scheme is flexible and allows us to address at the same time cluster and intrinsic sources of load imbalance. We then show measurements of the performance of our code on a test case of astrophysical interest in order to test the performance of our implementation.

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

Capanic: A Parallel Tree N-Body Code for Inhomogeneous Clusters of Processors 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 Capanic: A Parallel Tree N-Body Code for Inhomogeneous Clusters of Processors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Capanic: A Parallel Tree N-Body Code for Inhomogeneous Clusters of Processors will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-673045

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