article · 1995

Distributed Dynamic Data-Structures for Parallel Adaptive Mesh-Refinement

Manish Parashar, James C. Browne

Cited by 0Abstract and details only

Abstract

This paper presents the design and implementation of dynamic distributed data-structures to support parallel adaptive (multigrid) finite difference codes based on hierarchical adaptive mesh-refinement (AMR) techniques for the solution of partial differential equations. The abstraction provided by the datastructures is a dynamic hierarchical grid where operations on the grid are independent of its distribution across processors in a parallel execution environment, and of the number of levels in the grid hierarchy. The distributed dynamic data-structures have been implemented aspart of a computational toolkit for the Binary Black-Hole NSF Grand Challenge project.

Cite this paper

APA 7

Parashar, M., & Browne, J. C. (1995). Distributed Dynamic Data-Structures for Parallel Adaptive Mesh-Refinement.

MLA 9

Parashar, Manish, and James C. Browne. “Distributed Dynamic Data-Structures for Parallel Adaptive Mesh-Refinement.” 1995.

Chicago

Parashar, Manish, and James C. Browne. 1995. “Distributed Dynamic Data-Structures for Parallel Adaptive Mesh-Refinement.”

Harvard

Parashar, M. and Browne, J.C. (1995) ‘Distributed Dynamic Data-Structures for Parallel Adaptive Mesh-Refinement’.

BibTeX

@article{parashar1995distributed,
  title = {{Distributed Dynamic Data-Structures for Parallel Adaptive Mesh-Refinement}},
  author = {Parashar, Manish and Browne, James C.},
  year = {1995}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.