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

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.

[1]  Courtenay T. Vaughan,et al.  Zoltan data management services for parallel dynamic applications , 2002, Comput. Sci. Eng..

[2]  H. Sagan.  Space-filling curves , 1994 .

[3]  B. Hendrickson,et al.  Zoltan: A Dynamic Load-Balancing Library for Parallel Applications , 2000 .

[4]  Boleslaw K. Szymanski,et al.  Adaptive Local Refinement with Octree Load Balancing for the Parallel Solution of Three-Dimensional Conservation Laws , 1997, J. Parallel Distributed Comput..

[5]  M. S. Warren,et al.  A parallel hashed Oct-Tree N-body algorithm , 1993, Supercomputing '93.

[6]  George Karypis,et al.  Parmetis parallel graph partitioning and sparse matrix ordering library , 1997 .

[7]  Michael S. Warren,et al.  A parallel hashed oct-tree N-body algorithm , 1993, Supercomputing '93. Proceedings.

[8]  Harold Carter Edwards,et al.  A parallel infrastructure for scalable adaptive finite element methods and its application to least squares C-infinity collocation , 1998 .

[9]  William F. Mitchell.  The Refinement-Tree Partition for Parallel Solution of Partial Differential Equations , 1998, Journal of research of the National Institute of Standards and Technology.

[10]  William F. Mitchell,et al.  Hamiltonian Paths Through Two- and Three-Dimensional Grids , 2005, Journal of research of the National Institute of Standards and Technology.

[11]  Vipin Kumar,et al.  Parallel Multilevel Diffusion Algorithms for Repartitioning of Adaptive Meshes , 1997 .

[12]  William F. Mitchell,et al.  The Design of a Parallel Adaptive Multi-level Code in Fortran 90 , 2002, International Conference on Computational Science.

[13]  W. Mitchell.  Adaptive refinement for arbitrary finite-element spaces with hierarchical bases , 1991 .

[14]  Scott B. Baden,et al.  Dynamic Partitioning of Non-Uniform Structured Workloads with Spacefilling Curves , 1996, IEEE Trans. Parallel Distributed Syst..

[15]  Courtenay T. Vaughan,et al.  Zoltan: Data-Management Services For Parallel Applications Developer's Guide , 2000 .

[16]  J. Tinsley Oden,et al.  Problem decomposition for adaptive hp finite element methods , 1995 .