Skip to main content
Article thumbnail
Location of Repository

Mesh Partitioning: a Multilevel Balancing and Refinement Algorithm

By C. Walshaw and M. Cross

Abstract

Multilevel algorithms are a successful class of optimisation techniques which address the mesh partitioning problem. They usually combine a graph contraction algorithm together with a local optimisation method which refines the partition at each graph level. In this paper we present an enhancement of the technique which uses imbalance to achieve higher quality partitions. We also present a formulation of the Kernighan-Lin partition optimisation algorithm which incorporates load-balancing. The resulting algorithm is tested against a different but related state-ofthe -art partitioner and shown to provide improved results. Keywords: graph-partitioning, mesh partitioning, load-balancing, multilevel algorithms. 1 Introduction The need for mesh partitioning arises naturally in many finite element (FE) and finite volume (FV) applications. Meshes composed of elements such as triangles or tetrahedra are often better suited than regularly structured grids for representing completely general ge..

Topics: graph-partitioning, mesh partitioning, load-balancing, multilevel algorithms
Year: 1998
OAI identifier: oai:CiteSeerX.psu:10.1.1.19.1836
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.gre.ac.uk/~c.walsha... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.