Skip to main content

Abstract

Several particle simulation algorithms, such as the Barnes-Hut [1] and the Fast Multipole method [2], proceed by hierarchically decomposing the simulation space and representing the distribution of the simulated particles in an adaptive tree data structure which varies as the simulation proceeds. Such tree structures are also used in radiosity calculation, computational fluid mechanics, and other applications. Managing such a structure on a distributed-memory machine poses significant difficulties in terms of communication costs and partitioning strategies. The irregular nature of the structures rules out the usual optimization techniques used with arrays. Hand-coding these irregular and dynamic data structures is error-prone and not easily portable.

This research was supported in part by grant N00014-93-1-0114 from ONR and CCR8908285 from NSF.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Barnes and P. Hut. A hierarchical O(N log N) force-calculation algorithm. Nature, page 324, 1986.

    Google Scholar 

  2. L. Greengard and V. Rokhlin. A fast algorithm for particle simulations. Journal of Computational Physics, page 73, 1987.

    Google Scholar 

  3. M. Warren and J. Salmon. Astrophysical N-body simulations using hierarchical tree data structures. In Proceedings of Supercomputing, 1992.

    Google Scholar 

  4. J. Singh. Parallel Hierarchical N-body Methods and their Implications for Multiprocessors. PhD thesis, Stanford University, 1993.

    Google Scholar 

  5. S. Bhatt, M. Chen, J. Cowie, C. Lin, and P. Liu. Object-oriented support for adaptive methods on parallel machines. In Object Oriented Numerics Conference, 1993.

    Google Scholar 

  6. S. Bhatt, M. Chen, C.-Y. Lin, and P. Liu. Abstractions for parallel N-body simulations. In Scalable High-Performance Computing Conference, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer Science+Business Media New York

About this chapter

Cite this chapter

Pai, A.S., Choo, Yi., Chen, M. (1996). Distributed Tree Structures for N-Body Simulation. In: Szymanski, B.K., Sinharoy, B. (eds) Languages, Compilers and Run-Time Systems for Scalable Computers. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2315-4_28

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-2315-4_28

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-5979-1

  • Online ISBN: 978-1-4615-2315-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics