Skip navigation

Multilevel mesh partitioning for optimising domain shape

Multilevel mesh partitioning for optimising domain shape

Walshaw, C. ORCID: 0000-0003-0253-7779, Cross, M., Diekmann, R. and Schlimbach, F. (1998) Multilevel mesh partitioning for optimising domain shape. Other. CMS Press (University of Greenwich), London, UK.

[img]
Preview
PDF (Author's accepted manuscript)
199_Walshaw_Multilevel mesh partitioning (AAM) 1998.pdf - Accepted Version

Download (245kB) | Preview

Abstract

Multilevel algorithms are a successful class of optimisation techniques which address the mesh partitioning problem for mapping meshes onto parallel computers. 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 in the graph with the aim of minimising the parallel communication overhead. However it has been shown that for certain classes of problem, the convergence of the underlying solution algorithm is strongly influenced by the shape or aspect ratio of the subdomains. 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: Monograph (Other)
Additional Information: Mathematics Research Report 98/IM/38. ISBN 978-1899991464
Pre-2014 Departments: School of Computing & Mathematical Sciences
Last Modified: 14 Oct 2016 08:59
Selected for GREAT 2016: None
Selected for GREAT 2017: None
Selected for GREAT 2018: None
URI: http://gala.gre.ac.uk/id/eprint/199

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics