Distribution-independent hierarchical algorithms for the N-body problem

Journal of Supercomputing

Volumn 12, Issue 4, 1998, Pages 303-323

  Aluru, Srinivas ^a   Gustafson, John ^b   Prabhu, G M ^c   Sevilgen, Fatih E ^d  

^a NEW MEXICO STATE UNIVERSITY   (United States)

^b IOWA STATE UNIVERSITY   (United States)

^c IOWA STATE UNIVERSITY   (United States)

^d SYRACUSE UNIVERSITY   (United States)

Author keywords

Barnes Hut Algorithm; Greengard's Algorithm; N body problem; Particle simulation; Quadtree

Indexed keywords

BARNES-HUT ALGORITHMS; GREENARD'S ALGORITHMS; N-BODY PROBLEM; PARTICLE SIMULATION; QUADTREE;

ASTROPHYSICS; COMPUTER SIMULATION; DIFFERENTIAL EQUATIONS; FLUID DYNAMICS; MOLECULAR DYNAMICS; PROBLEM SOLVING; ALGORITHMS; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; TREES (MATHEMATICS);

ALGORITHMS; HIGH ENERGY PHYSICS;

BARNES-HUT ALGORITHM; GREENGARD'S ALGORITHM; HIERARCHICAL ALGORITHMS; N-BODY PROBLEM;

EID: 0032179944     PISSN: 09208542     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008047806690     Document Type: Article

References (24)

1. S. Aluru, Distribution-independent hierarchical N-body methods, Ph.D. thesis, Iowa State University, 1994.
2. S. Aluru, G.M. Prabhu and J. Gustafson, Truly distribution-independent hierarchical algorithms for the N-body problem, Proc. Supercomputing '94 (1994) 420-428.
3. R.J. Anderson, Tree Data Structures for N-Body Simulations, Proc. Annual Symposium on Foundations of Computer Science, (1996) 224-233.
4. A.W. Appel, An efficient program for many-body simulation, SIAM J. Sci. Stat. Comput., 6 (1985) 85-103.
5. J. Barnes, A modified tree code: Don't laugh; It runs, J. Comput. Phys., 87 (1990) 161-170.
6. J. Barnes and P. Hut, A hierarchical O(N log N) force-calculation algorithm, Nature, 324 (1986) 446-449.
7. S. Bhatt, M. Chen, C.Y. Len and P. Liu, Abstractions for parallel N-body simulations, Tech. Rep. DCS/TR-895, Yale University, 1992.
8. P.B. Callahan and S.R. Kosaraju, A decomposition of multidimensional point sets with applications to k-nearest neighbors and n-body potential fields, J. of the ACM, 42(1) (1995) 67-90.
9. K. Esselink, The order of Appel's algorithm, Info. Proc. Letters, 41 (1992) 141-147.
10. L. Greengard, The rapid evaluation of potential fields in particle systems, MIT Press, Cambridge, MA, 1988.
11. L. Greengard and V. Rokhlin, A fast algorithm for particle simulations, J. Comp. Phys., 73 (1987) 325-348.
12. L. Hernquist, Vectorization of tree traversals, J. Comp. Phys., 87 (1990) 137-147.
13. R.W. Hockney and J.W. Eastwood, Computer simulation using particles, McGraw-Hill, New York, 1981.
14. J. Katzenelson, Computational structure of the N-body problem, SIAM. J. Sci. Stat. Comput., 10 (1989) 787-915.
15. J. Makino, Vectorization of a treecode, J. Comp. Phys., 87 (1990) 148-160.
16. E.M. Me Creight, Priority Search Trees, SIAM J. Comput (1985) 257-268.
17. R.H. Miller and K.H. Prendergast, Stellar dynamics in a discrete phase space, Astrophys. J., 151 (1968) 699-709.
18. R.H. Miller, K.H. Prendergast and W.J. Quirk, Numerical experiments on spiral structure, Astrophys. J., 161 (1970) 903-916.
19. J.K. Salmon, Parallel hierarchical N-body methods, Ph.D. thesis, California Institute of Technology, 1990.
20. J.P. Singh, Parallel hierarchical N-body methods and their implications for multiprocessors, Ph.D. thesis, Stanford University, 1993.
21. J.P. Singh, C. Holt, T. Totsuka, A. Gupta and J.L. Hennesy, Load balancing and data locality in hierarchical N-body methods, Journal of Parallel and Distributed Computing, to appear.
22. M.S. Warren and J.K. Salmon, Astrophysical N-body simulations using hierarchical tree data structures, Proc. Supercomputing '92 (1992) 570-576.
23. M.S. Warren and J.K. Salmon, A parallel hashed oct-tree N-body algorithm, Proc. Supercomputing '93 (1993) 1-12.
24. F. Zhao and L. Johnsson, The parallel multipole method on the connection machine, SIAM. J. Sci. Stat. Comput., 12 (1991) 1420-1437.