Scalable parallel formulations of the Barnes-Hut method for n-body simulations

We present two new parallel formulations of the Barnes-Hut method. These parallel formulations are especially suited for simulations with irregular particle densities. We first present a parallel formulation that uses a static partitioning of the domain and assignment of subdomains to processors. We demonstrate that this scheme delivers acceptable load balance, and coupled with two collective communication operations, it yields good performance. We present a second parallel formulation which combines static decomposition of the domain with an assignment of subdomains to processors based on Morton ordering. This alleviates the load imbalance inherent in the first scheme. The second parallel formulation is inspired by two currently best known parallel algorithms for the Barnes-Hut method. We present an experimental evaluation of these schemes on a 256 processor nCUBE2 parallel computer for an astrophysical simulation.<<ETX>>

[1]  J. W. Causey,et al.  Accelerated molecular dynamics simulation with the parallel fast multipole algorithm , 1992 .

[2]  Joel H. Saltz,et al.  Unstructured scientific computation on scalable multiprocessors , 1992 .

[3]  Joel H. Saltz,et al.  An Anlysis of Scatter Decomposition , 1990, IEEE Trans. Computers.

[4]  L. Greengard.  The Rapid Evaluation of Potential Fields in Particle Systems , 1988 .

[5]  Vipin Kumar,et al.  Scalable parallel formulations of the barnes-hut method for n-body simulations , 1994, Supercomputing '94.

[6]  K. Esselink.  The order of Appel's algorithm , 1992 .

[7]  Piet Hut,et al.  A hierarchical O(N log N) force-calculation algorithm , 1986, Nature.

[8]  Michael S. Warren,et al.  Astrophysical N-body simulations using hierarchical tree data structures , 1992, Proceedings Supercomputing '92.

[9]  James F. Leathrum,et al.  Mapping the adaptive fast multipole algorithm onto MIMD systems , 1992 .

[10]  Andrew W. Appel,et al.  An Efficient Program for Many-Body Simulation , 1983 .

[11]  K. Schmidt,et al.  Implementing the fast multipole method in three dimensions , 1991 .

[12]  William Gropp,et al.  A Parallel Version of the Fast Multipole Method-Invited Talk , 1987, PPSC.

[13]  Alan Weiss,et al.  Allocating Independent Subtasks on Parallel Processors , 1985, IEEE Transactions on Software Engineering.

[14]  S. Rao Kosaraju,et al.  A decomposition of multi-dimensional point-sets with applications to k-nearest-neighbors and n-body potential fields (preliminary version) , 1992, STOC '92.

[15]  Leslie Greengard,et al.  A fast algorithm for particle simulations , 1987 .

[16]  Anoop Gupta,et al.  Load Balancing and Data locality in Adaptive Hierarchical N-Body Methods: Barnes-Hut, Fast Multipole, and Rasiosity , 1995, J. Parallel Distributed Comput..

[17]  M. S. Warren,et al.  A parallel hashed Oct-Tree N-body algorithm , 1993, Supercomputing '93.

[18]  Feng Zhao,et al.  The Parallel Multipole Method on the Connection Machine , 1991, SIAM J. Sci. Comput..

[19]  Srinivas Aluru.  Greengard's N-Body Algorithm is not Order N , 1996, SIAM J. Sci. Comput..