Publication Date:
2019-07-13
Description:
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.
Keywords:
Computer Systems
Type:
IPPS''99; Apr 12, 1999 - Apr 16, 1999; San Juan; Puerto Rico
Format:
application/pdf
Permalink