Abstract
We describe the design and implementation of efficient par- allel algorithms,and software library for the parallel implementation of compressed octree data structures. Octrees are widely used in supporting hierarchical methods for scientific applications such s the N-body prob- lem,molecular dynamics and smoothed particle hydrodynamics. The pri- mary goal of our work is to identify and abstract the commonalities present in various hierarchical methods using octrees,design efficient parallel algorithms for them,and encapsulate them in software library. We designed provably efficient parallel algorithms and implementation strategies that perform well irrespective of data distribution. The library will enable rapid development of applications,allowing application de- velopers to use efficient parallel algorithms developed for this purpose, without the necessity of having detailed knowledge of the algorithms or of implementing them. The software is developed in Causing the Message Passing Interface (MPI). We report experimental results on an IBM SP and Pentium cluster.
Research supported by NSF Career under CCR-0096288 and NSF CCR-9988347.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S. Aluru and F. Sevilgen, Dynamic compressed hyperoctrees with applications to N-body problem, Proc. Foundations of Software Technology and Theoretical Computer Science (1999) 21–33.
V. Kumar, A. Grama, A. Gupta and G. Karypis,Introduction to Parallel Computing, The Benjamin/Cummings Publishing Co., 1994.
P. Liu and S. Bhatt,Experiences with parallel N-body simulation,IEEE Transactions on Parallel and Distributed Systems,11(12)(2000)1306–1323.
G.M. Morton,A computer oriented geodesic data base and new technique in file sequencing,IBM,Ottaw,Canada,1966.
S. Ranka, R.V. Shankar and K.A. Alsabti,Many-to-many communication with bounded traffic,Prod. Frontiers of Massively Parallel Computation (1995)20–27.
H. Samet,Design and analysis of spatial data structures,Addison-Wesley Publish-ing Company,1990.
F. Sevilgen, S. Aluru and N. Futamura,A provably optimal,distribution-independent,parallel fast multipole method,Proc.International Parallel and Distributed Processing Symposium (2000)77–84.
H. Shan and J.P. Singh,Parallel tree building on range of shared address space multiprocessors:algorithms and application performance,Proc. International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing (1998)475–484.
M.S. Warren and J.K. Salmon,A parallel hashed oct-tree N-body algorithm,Proc. Supercomputing (1993)1–12.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hariharan, B., Aluru, S. (2001). Efficient Parallel Algorithms and Software for Compressed Octrees with Applications to Hierarchical Methods. In: Monien, B., Prasanna, V.K., Vajapeyam, S. (eds) High Performance Computing — HiPC 2001. HiPC 2001. Lecture Notes in Computer Science, vol 2228. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45307-5_12
Download citation
DOI: https://doi.org/10.1007/3-540-45307-5_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43009-4
Online ISBN: 978-3-540-45307-9
eBook Packages: Springer Book Archive