A New Approach to Parallel Dynamic Partitioning for Adaptive Unstructured Meshes

Classical mesh partitioning algorithms were designed for rather static situations, and their straightforward application in a dynamical framework may lead to unsatisfactory results, e.g., excessive data migration among processors. Furthermore, special attention should be paid to their amenability to parallelization. In this paper, a novel parallel method for the dynamic partitioning of adaptive unstructured meshes is described. It is based on a linear representation of the mesh using self-avoiding walks.

• Type: Conference
• Year: 1999
• Where: IPPS
• Authors: Gerd Heber, Guang R. Gao, Rupak Biswas
• Keywords: Adaptive Unstructured Meshes, Distributed And Parallel Computing, Excessive Data Migration, IPPS 1999, Mesh Partitioning Algorithms