carrier image

Using Graph Partitioning and Coloring for Flexible Coarse-Grained Shared-Memory Parallel Mesh Adaptation

Gnam, Lukas, Josef Weinbub, Karl Rupp, Florian Rudolf, Siegfried Selberherr

Research Notes, 26th International Meshing Roundtable, Sandia National Laboratories, September 18-21 2017

INTERNATIONAL
MESHING
ROUNTABLE

26th International Meshing Roundtable
Barcelona, Spain
September 18-21, 2017

Lukas Gnam, Christian Doppler Laboratory for HPTCAD, Institute for Microelectronics, TU Wien, Vienna, AT, gnam@iue.tuwien.ac.at
Josef Weinbub, Christian Doppler Laboratory for HPTCAD, Institute for Microelectronics, TU Wien, Vienna, AT,
Karl Rupp, Institute for Microelectronics, TU Wien, Vienna, AT,
Florian Rudolf, Institute for Microelectronics, TU Wien, Vienna, AT,
Siegfried Selberherr, Institute for Microelectronics, TU Wien, Vienna, ,

Research Note Abstract
We present a flexible coarse-grained shared-memory parallel mesh adaptation approach based on graph partitioning and graph coloring. The strength of our approach is the ability to use existing serial meshing algorithms for the overall parallel meshing workflow. Our approach does not require a fine-grained parallel meshing algorithm and thus reduces development effort for parallelizing serial meshing algorithms and enables flexibility in devising various parallel meshing workflows. We achieve speedups of 3.4 to 4.0 for two-dimensional and 4.3 to 4.4 for three-dimensional simplex volume mesh refinement tasks with up to 16 threads and compare our approach to the parallel meshing library PRAgMaTIc.

Download Full Paper (PDF)


Contact author(s) or publisher for availability and copyright information on above referenced article