Skip navigation

Multilevel mesh partitioning for aspect ratio

Multilevel mesh partitioning for aspect ratio

Walshaw, C. ORCID: 0000-0003-0253-7779, Cross, M., Diekmann, R. and Schlimbach, F. (1998) Multilevel mesh partitioning for aspect ratio. In: 3rd Internatinal Meeting on Vector & Parallel Processing - VECPAR '98, June 21-23, 1998, Porto, Portugal.

Full text not available from this repository.

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. To date these algorithms have been used almost exclusively to minimise the cut-edge weight, however it has been shown that for certain classes of solution algorithm, the convergence of the solver is strongly influenced by the subdomain aspect ratio. In this paper therefore, we modify the multilevel algorithms in order to optimise a cost function based on aspect ratio. Several variants of the algorithms are tested and shown to provide excellent results.

Item Type: Conference or Conference Paper (Paper)
Pre-2014 Departments: School of Computing & Mathematical Sciences
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/401

Actions (login required)

View Item View Item