Parallel adaptive mesh refinement and redistribution on distributed memory computers

Abstract A procedure to support parallel refinement and redistribution of two-dimensional unstructured finite element meshes on distributed memory computers is presented. The procedure uses the mesh topological entity hierarchy as the underlying data structures to easily support the required adjacency information. Mesh refinement is done by employing links back to the geometric representation to place new nodes on the boundary of the domain directly on the curved geometry. The refined mesh is then redistributed by an iterative heuristic based on the Leiss-Reddy [1] load balancing criteria. A fast parallel tree edge-coloring algorithm is used to pair processors having adjacent partitions and forming a tree structure as a result of Leiss-Reddy load request criteria. Excess elements are iteratively migrated from heavily loaded to less loaded processors until load balancing is achieved. The system is implemented on a massively parallel MasPar MP-1 system with a SIMD style of computation and uses message passing primitives to migrate elements during the mesh redistribution phase. Performance results of the redistribution heuristics on various test meshes are given.

[1]  Douglas H. Norrie,et al.  An introduction to finite element analysis , 1978 .

[2]  Mark S. Shephard,et al.  Automatic three-dimensional mesh generation by the finite octree technique , 1984 .

[3]  Mark S. Shephard,et al.  Automatic three‐dimensional mesh generation by the finite octree technique , 1984 .

[4]  M. Rivara.  Algorithms for refining triangular grids suitable for adaptive and multigrid techniques , 1984 .

[5]  Rainald Loehner,et al.  A parallelizable load balancing algorithm , 1993 .

[6]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[7]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[8]  Martin Berzins,et al.  Dynamic load-balancing for PDE solvers on adaptive unstructured meshes , 1995, Concurr. Pract. Exp..

[9]  Shahid H. Bokhari,et al.  A Partitioning Strategy for Nonuniform Problems on Multiprocessors , 1987, IEEE Transactions on Computers.

[10]  Mark S. Shephard,et al.  Unsteady Compressible Rotor Airfoil Aerodynamics Using an Automated Adaptive Finite Element Method , 1993 .

[11]  D. Nicol,et al.  Parametric binary dissection , 1993 .

[12]  Roy D. Williams,et al.  Performance of dynamic load balancing algorithms for unstructured mesh calculations , 1991, Concurr. Pract. Exp..

[13]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

[14]  Joseph E. Flaherty,et al.  A massively parallel adaptive finite element method with dynamic load balancing , 1993, Supercomputing '93. Proceedings.

[15]  Steven Warren Hammond,et al.  Mapping unstructured grid computations to massively parallel computers , 1992 .

[16]  Kevin Weiler,et al.  Edge-Based Data Structures for Solid Modeling in Curved-Surface Environments , 1985, IEEE Computer Graphics and Applications.

[17]  Stephen R. Wheat,et al.  Experience with automatic, dynamic load balancing and adaptive finite element computation , 1994, 1994 Proceedings of the Twenty-Seventh Hawaii International Conference on System Sciences.

[18]  Joseph E. Flaherty,et al.  Adaptive Methods for Partial Differential Equations , 1989 .