Efficient parallel algorithms and software for compressed octrees with applications to hierarchical methods

Parallel Computing

Volumn 31, Issue 3-4, 2005, Pages 311-331

  Hariharan, Bhanu ^a   Aluru, Srinivas ^b  

^a PetroTel Inc   (United States)

^b Iowa State University of Science and Technology   (United States)

Author keywords

Compressed octrees; Hierarchical methods; Parallel algorithms; Parallel software library; Parallel tree data structures

Indexed keywords

COMPUTER SOFTWARE; DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; HIERARCHICAL SYSTEMS; HYDRODYNAMICS; MATHEMATICAL MODELS; MOLECULAR DYNAMICS; PARALLEL PROCESSING SYSTEMS;

COMPRESSED OCTREES; FAST MULTIPOLE METHODS (FMM); HIERARCHICAL METHODS; PARALLEL SOFTWARE LIBRARY; PARALLEL TREE DATA STRUCTURES;

PARALLEL ALGORITHMS;

EID: 18844402673     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2004.12.007     Document Type: Article

References (17)

1. S. Aluru, F. Sevilgen, Dynamic compressed hyperoctrees with applications to N-body problem, in: Proceedings of Foundations of Software Technology and Theoretical Computer Science, 1999, pp. 21-33
2. K.C. Donepudi, J.M. Jin, S. Velamparambil, J. Song, and W.C. Chew IEEE Transactions on Antennas and Propagation 49 2001 1069 1078
3. V. Kumar, A. Grama, A. Gupta, and G. Karypis Introduction to Parallel Computing 1994 The Benjamin/Cummings Publishing Co.
4. J.F. Leathrum, Parallelization of the fast multipole algorithm: algorithm and architecture design, Ph.D. thesis, Duke University, 1992
5. P. Liu, and S. Bhatt Experiences with parallel N-body simulations IEEE Transactions on Parallel and Distributed Systems 11 12 2000 1306 1323
6. E.J.L. Lu, D.I. Okunbor, Parallel Implementation of 3D FMA using MPI, in: Proceedings of MPI Developers Conference, July 1996, pp. 119-124
7. E.J.L. Lu, D.I. Okunbor, An efficient load balancing technique for parallel FMA in message passing environment, in: Proceedings of Eighth SIAM Conference on Parallel Processing for Scientific Computing, March 1997
8. G.M. Morton A computer oriented geodesic data base and a new technique in file sequencing 1966 IBM Ottawa, Canada
9. S. Ranka, R.V. Shankar, K.A. Alsabti, Many-to-many communication with bounded traffic, in: Proceedings of the Frontiers of Massively Parallel Computation, 1995, pp. 20-27
10. S.M. Rao, and D.R. Wilton Transient scattering by conducting surfaces of arbitrary shape IEEE Transactions on Antennas and Propagation 39 1991 56 61
11. J.K. Salmon, Parallel hierarchical N-body methods, Ph.D. thesis, California Institute of Technology, 1990
12. H. Samet Design and analysis of spatial data structures 1990 Addison-Wesley Publishing Company
13. F.E. Sevilgen, S. Aluru, and N. Futamura Parallel algorithms for tree accumulations Journal of Parallel and Distributed Computing 65 1 2005 85 93
14. H. Shan, J.P. Singh, Parallel tree building on a range of shared address space multiprocessors: algorithms and application performance, in: Proceedings of International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing, 1998, pp. 475-484
15. J.P. Singh, C. Holt, J.L. Hennessy, A. Gupta, A parallel adaptive fast multipole method, in: Proceedings of Supercomputing, 1993, pp. 54-65
16. M.S. Warren, J.K. Salmon, Astrophysical N-body simulations using hierarchical tree data structures, in: Proceedings of Supercomputing, 1992, pp. 570-576
17. M.S. Warren, J.K. Salmon, A parallel hashed oct-tree N-body algorithm, in: Proceedings of Supercomputing, 1993, pp. 1-12