Skip navigation

Mesh partitioning: a multilevel balancing and refinement algorithm

Mesh partitioning: a multilevel balancing and refinement algorithm

Walshaw, C. ORCID: 0000-0003-0253-7779 and Cross, M. (2000) Mesh partitioning: a multilevel balancing and refinement algorithm. SIAM Journal on Scientific Computing, 22 (1). pp. 63-80. ISSN 1064-8275 (Print), 1095-7197 (Online) (doi:10.1137/S1064827598337373)

Full text not available from this repository.

Abstract

Multilevel algorithms are a successful class of optimization techniques which addresses the mesh partitioning problem. They usually combine a graph contraction algorithm together with a local optimization 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 optimization algorithm which incorporates load-balancing. The resulting algorithm is tested against a different but related state-of-the-art partitioner and shown to provide improved results.

Item Type: Article
Uncontrolled Keywords: graph-partitioning, mesh partitioning, load-balancing, multilevel algorithms
Subjects: Q Science > QA Mathematics
Pre-2014 Departments: School of Computing & Mathematical Sciences
School of Computing & Mathematical Sciences > Centre for Numerical Modelling & Process Analysis
School of Computing & Mathematical Sciences > Centre for Numerical Modelling & Process Analysis > Computational Science & Engineering Group
School of Computing & Mathematical Sciences > Computer & Computational Science Research Group
School of Computing & Mathematical Sciences > Department of Computer Science
School of Computing & Mathematical Sciences > Department of Mathematical Sciences
Related URLs:
Last Modified: 14 Oct 2016 09:00
Selected for GREAT 2016: None
Selected for GREAT 2017: None
Selected for GREAT 2018: None
URI: http://gala.gre.ac.uk/id/eprint/412

Actions (login required)

View Item View Item