On partitioning dynamic adaptive grid hierarchies
- 1 January 1996
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 68, 604-613 vol.1
- https://doi.org/10.1109/hicss.1996.495511
Abstract
This paper presents a computationally efficient run-time partitioning and load-balancing scheme for the distributed adaptive grid hierarchies that underlie adaptive mesh-refinement methods. The partitioning scheme yields an efficient parallel computational structure that maintains locality to reduce communications. Further, it enables dynamic re-partioning and load balancing of the adaptive grid hierarchy to be performed cost-effectively. The run-time partitioning support presented has been implemented within the framework of a data-management infrastructure supporting dynamic distributed data-structures for parallel adaptive numerical techniques. This infrastructure is the foundational layer of a computational toolkit for the Binary Black-Hole NSF Grand Challenge project.Keywords
This publication has 4 references indexed in Scilit:
- Adaptive mesh refinement for hyperbolic partial differential equationsPublished by Elsevier ,2004
- Space-Filling CurvesPublished by Springer Nature ,1994
- Extendible hashing—a fast access method for dynamic filesACM Transactions on Database Systems, 1979
- Sur une courbe, qui remplit toute une aire planeMathematische Annalen, 1890