A refinement-tree based partitioning method for dynamic load balancing with adaptively refined grids

Authors:
William F. Mitchell
Affiliations:
Mathematical and Computational Sciences Division, National Institute of Standards and Technology, Gaithersburg, MD 20899-8910, USA
Venue:
Journal of Parallel and Distributed Computing
Year:
2007

Citing 6
Cited 5

Adaptive refinement for arbitrary finite-element spaces with hierarchical bases

Journal of Computational and Applied Mathematics
A parallel hashed Oct-Tree N-body algorithm

Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Dynamic Partitioning of Non-Uniform Structured Workloads with Spacefilling Curves

IEEE Transactions on Parallel and Distributed Systems
Adaptive local refinement with octree load balancing for the parallel solution of three-dimensional conservation laws

Journal of Parallel and Distributed Computing - Special issue on dynamic load balancing
A parallel infrastructure for scalable adaptive finite element methods and its application to least squares C-infinity collocation

A parallel infrastructure for scalable adaptive finite element methods and its application to least squares C-infinity collocation
The Design of a Parallel Adaptive Multi-level Code in Fortran 90

ICCS '02 Proceedings of the International Conference on Computational Science-Part III

Memory efficient adaptive mesh generation and implementation of multigrid algorithms using Sierpinski curves

International Journal of Computational Science and Engineering
Efficient O(N) integration for all-electron electronic structure calculation using numeric basis functions

Journal of Computational Physics
Implementation of 2D parallel ALE mesh generation technique in FSI problems using OpenMP

Proceedings of the 7th International Conference on Frontiers of Information Technology
Dynamically Adaptive Simulations with Minimal Memory Requirement—Solving the Shallow Water Equations Using Sierpinski Curves

SIAM Journal on Scientific Computing
Memory-Efficient sierpinski-order traversals on dynamically adaptive, recursively structured triangular grids

PARA'10 Proceedings of the 10th international conference on Applied Parallel and Scientific Computing - Volume 2

Quantified Score

Hi-index	0.01

Visualization

Abstract

The partitioning of an adaptive grid for distribution over parallel processors is considered in the context of adaptive multilevel methods for solving partial differential equations. A partitioning method based on the refinement-tree is presented. This method applies to most types of grids in two and three dimensions. For triangular and tetrahedral grids, it is guaranteed to produce connected partitions; no other partitioning method makes this guarantee. The method is related to the OCTREE method and space filling curves. Numerical results comparing it with several popular partitioning methods show that it computes partitions in an amount of time similar to fast load balancing methods like recursive coordinate bisection, and with mesh quality similar to slower, more optimal methods like the multilevel diffusive method in ParMETIS.