A unifying data structure for hierarchical methods

ACM/IEEE SC 1999 Conference, SC 1999

Volumn , Issue , 1999, Pages 24-

  Sevilgen, Fatih E ^a   Aluru, Srinivas ^b  

^a SYRACUSE UNIVERSITY   (United States)

^b IOWA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; NEAREST NEIGHBOR SEARCH;

ACCESS PATTERNS; EFFICIENT DATA STRUCTURES; HIERARCHICAL METHOD; LONG RANGE INTERACTIONS; MULTIPLE METHODS; NEAREST NEIGHBOR QUERIES; PARTICLE-BASED METHODS; SCIENTIFIC APPLICATIONS;

TREES (MATHEMATICS);

EID: 84877012388     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SC.1999.10056     Document Type: Conference Paper

References (20)

1. S. Aluru, G.M. Prabhu, J. Gustafson and F. Sevilgen, Distribution-independent hierarchical algorithm for the N-body problem, Journal of Supercomputing, 12 (1998) 303-323.
2. T. Belytschko, Y. Krongauz, D. Organ, M. Fleming, and P. Krysl, "Meshless methods: An overview and recent developments, Computer Methods in Applied Mechanics and Engineering 139, (1996) 3-47.
3. J. Barnes and P. Hut, A hierarchical O(N logN) force-calculation algorithm, Nature, 324 (1986) 446-449.
4. J.L. Bentley, Multidimensional binary search trees used for associative searching, Communications of the ACM, 18(9) (1975) 509-517.
5. 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.
6. K. L. Clarkson, Fast algorithms for the all nearest neighbors problem, Proc. Foundations of Computer Science (1983) 226-232.
7. M.D. Dikaiakos and J. Stadel, A performance study of cosmological simulations on message-passing and sharedmemory multiprocessors, Proc. International Conference on Supercomputing (1996) 94-101.
8. G. Eisenhauer and K. Schwan, Design and analysis of a parallel molecular dynamics application, Journal of Parallel and Distributed Computing, 35 (1996) 76-90.
9. L. Greengard, The rapid evaluation of potential fields in particle systems, MIT Press, Cambridge, MA, 1988.
10. L. Hernquist and N. Katz, TREESPH: A unification of SPH with the hierarchical tree method, The Astrophysical journal. Supplement series, 70 (1989) 419.
11. L.D. Libersky, A.G. Petschek, T.C. Carney, J.R. Hipp and F.A. Allahdadi, High strain Lagrangian hydrodynamics: A three dimensional SPH code for dynamic material response, Journal of Computational Physics, 109 (1993) 67-75.
12. H.J. Neeman, Autonomous Hierarchical Adaptive Mesh Refinement for Multistage Simulations, Ph.D. Thesis, University of Illinois at Urbana-Champaign, IL, 1996.
13. M. Parashar and J.C. Browne, Distributed dynamic data-structures for parallel adaptive mesh-refinement, Proc. International Conference for High Performance Computing (1995) 22-27.
14. M. Parashar J.C. Browne, C. Edwards and K. Klimkowski, A common computational infrastructure for adaptive algorithms for PDE solutions, Proc Supercomputing '97 (1997).
15. S. Plimpton, S. Attaway, B. Hendrickson, J. Swegle, C. Vaughan and D. Gardner, Parallel transient dynamics simulations: Algorithms for contact detection and smoothed particle hydrodynamics, Journal of Parallel and Distributed Computing, 50 1998 104-122.
16. H. Samet, The Design and Analysis of Spatial Data Structures, Addison-Wesley, 1990.
17. H. Samet, Applications of Spatial Data Structures, Addison-Wesley, 1990.
18. V.E. Taylor, R.L. Stevens and K.E. Arnold, Parallel molecular dynamics: Implications for massively parallel machines, Journal of Parallel and Distributed Computing, 45 (1997) 166-175.
19. P.M. Vaidya, An O(n log n) Algorithm for the All-Nearest-Neighbors problem, Discrete Computational Geometry (4), 101-115 (1989).
20. M.S. Warren and J.K. Salmon, A parallel hashed oct-tree N-body algorithm, Proc. Supercomputing '93 (1993) 1-12.