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

Parallel Computing

Volumn 24, Issue 5-6, 1998, Pages 797-822

  Grama, Ananth ^a   Kumar, Vipin ^b   Sameh, Ahmed ^a  

^a Purdue University   (United States)

^b University of Minnesota   (United States)

Author keywords

Communication; Experimental results; Hierarchical tree code; Load balance; n Body simulation; Partitioning

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SIMULATION; NATURAL SCIENCES COMPUTING; TREES (MATHEMATICS);

BARNES HUT METHOD; DOMAIN DECOMPOSITION; HIERARCHICAL TREE CODES; LOAD BALANCE;

PARALLEL PROCESSING SYSTEMS;

EID: 0032097210     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(98)00011-8     Document Type: Article

References (21)

1. J. Barnes, P. Hut, A hierarchical 0(nlog n) force calculation algorithm, Nature 324 (1986) .
2. L. Greengard, V. Rokhlin, A fast algorithm for particle simulations, J. Comp. Phys. 73 (1987) 325-348.
3. S. Aluru, Greengard's n-body algorithm is not O(n) SIAM J. Sci. Comput. 17 (3) (1996) 773-776.
4. P.B. Callahan, S.R. Kosaraju, A decomposition of multi-dimensional point-sets with applications to k-nearest-neighbors and n-body potential fields, Proc. 24th Annual ACM Symp. on Theory of Computing, May 1992, pp. 546-556.
5. A.W. Appel, An efficient program for many-body simulation, SIAM J. Comput. 6 (1985) .
6. K. Esselink, The order of Appel's algorithm, Inf. Processing Lett. 41 (1992) 141-147.
7. L. Greengard, The Rapid Evaluation of Potential Fields in Particle Systems, MIT Press, 1987.
8. L. Greengard, W. Gropp, A parallel version of the fast multipole method, Parallel Processing for Scientific Computing, 1987, pp. 213-222.
9. J.A. Board, J.W. Causey, J.F. Leathrum, A. Windemuth, K. Schulten, Accelerated molecular dynamics with the fast multipole algorithm, Chem. Phys. Lett. 198 (1992) 89.
10. F. Zhao, S.L. Johnsson, The parallel multipole method on the connection machine, SIAM J. Sci. Stat. Comp. 12 (1991) 1420-1437.
11. J.F. Leathrum, J.A. Board, Mapping the adaptive fast multipole algorithm into mind systems, in: P. Mehrotra, J. Saltz (Eds.), Unstructured Scientific Computation on Scalable Multiprocessors, MIT Press, Cambridge, MA, 1992.
12. K.E. Schmidt, M.A. Lee, Implementing the fast multipole method in three dimensions, J. Stat. Phys. 63 (1991) 1120.
13. J. Singh, C. Holt, T. Totsuka, A. Gupta, J. Hennessy, Load balancing and data locality in hierarchical n-body methods, J. Parallel Distributed Comput., 1994.
14. M. Warren, J. Salmon, A parallel hashed oct tree n-body algorithm, Proceedings of Supercomputing Conference, 1993.
15. M. Warren, J. Salmon, Astrophysical n-body simulations using hierarchical tree data structures, Proceedings of Supercomputing Conference, 1992.
16. A. Grama, V. Kumar, A. Sameh, Scalable parallel formulations of the Barnes-Hut method for n-body simulations, Supercomputing '94 Proc., 1994.
17. A. Grama, V. Kumar, A. Sameh, Parallel matrix-vector product using hierarchical methods, in: Proc. Supercomputing '95, San Diego, CA, 1995.
18. R.J. Anderson, Computer science problems in astrophysical simulation, Silver Jubilee Workshop on Computing and Intelligent Systems, Indian Institute of Science, Tata McGraw-Hill Publishing, New Delhi, 1993.
19. D.M. Nicol, J.H. Saltz, An analysis of scatter decomposition, IEEE Trans. Comp. 39 (1990) 1337-1345.
20. V. Kumar, A. Grama, A. Gupta, G. Karypis, Introduction to Parallel Computing: Algorithm Design and Analysis, Benjamin Cummings/Addison Wesley (ISBN 0-8053-3170-0), Redwood City, 1994.
21. C.P. Kruskal, A. Weiss, Allocating independent subtasks on parallel processors, IEEE Trans. Software Eng. SE-11 (10) (1985) 1001-1016.