A unified framework of multi-objective cost functions for partitioning unstructured finite element meshes

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Good performance of parallel finite element computations on unstructured meshes requires high-quality mesh partitioning. Such a decomposition task is normally done by a graph-based partitioning approach. However, the main shortcoming of graph partitioning algorithms is that minimizing the so-called edge cut is not entirely the same as minimizing the communication overhead. This paper thus proposes a unified framework of multi-objective cost functions, which take into account several factors that are not captured by the graph-based partitioning approach. Freely adjustable weighting parameters in the framework also promote a flexible treatment of different optimization objectives. A greedy-style post-improvement procedure is designed to use these cost functions to improve the quality of subdomain meshes arising from the graph-based partitioning approach. Both serial and parallel implementation of the post-improvement procedure have been done. Numerical experiments show that communication overhead can indeed be reduced by this improvement procedure, thereby increasing the performance of parallel finite element computations. © 2006 Elsevier Inc. All rights reserved.

Cite

CITATION STYLE

APA

Cai, X., & Bouhmala, N. (2007). A unified framework of multi-objective cost functions for partitioning unstructured finite element meshes. Applied Mathematical Modelling, 31(9), 1711–1728. https://doi.org/10.1016/j.apm.2006.06.007

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free