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

  • Hariharan B
  • Aluru S
  • 24

    Readers

    Mendeley users who have this article in their library.
  • 19

    Citations

    Citations of this article.

Abstract

We describe the design and implementation of efficient parallel algorithms, and a software library for the parallel implementation of compressed octree data structures. Octrees are widely used in supporting hierarchical methods for scientific applications such as the N-body problem, molecular dynamics and smoothed particle hydrodynamics. The primary 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 a software library. We designed provably efficient parallel algorithms and implementation strategies that perform well irrespective of the spatial distribution of data in the computational domain. The library will enable rapid development of applications, allowing application developers 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 C using the Message Passing Interface (MPI). We report experimental results on an IBM xSeries parallel computer. © 2005 Elsevier B.V. All rights reserved.

Author-supplied keywords

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

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Bhanu Hariharan

  • Srinivas Aluru

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free