Parallel adaptive mesh refinement and redistribution on distributed memory computers

https://doi.org/10.1016/0045-7825(94)00080-8Get rights and content

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.

References (21)

  • E. Leiss et al.

    Distributed load balancing: Design and performance analysis

    W.M. Keck Research Computation Laboratory

    (1989)
  • M.J. Berger et al.

    A partitioning strategy for nonuniform problems on multiprocessors

    IEEE Trans. Comput.

    (May 1987)
  • M. Fiedler

    Algebraic connectivity of graphs

    Czechoslovak Math. J.

    (1973)
  • A. Pothen et al.

    Partitioning sparse matrices with eigenvectors of graphs

    SIAM J. Matrix Anal. Appl.

    (July 1990)
  • R.D. Williams

    Performance of dynamic load balancing algorithms for unstructured grid calculations

    Technical Report C3P913

    (1990)
  • S.W. Hammond

    Mapping unstructured grid computations to massively parallel computers

  • K.D. Devine et al.

    A massively parallel adaptive finite element method with dynamic load balancing

  • S.R. Wheat et al.

    Experience with automatic, dynamic load balancing and adaptive finite element computation

  • R. Lohner et al.

    A parallelizable load balancing algorithm

There are more references available in the full text version of this article.

Cited by (0)

View full text