Computational & Technology Resources
an online resource for computational,
engineering & technology publications
Civil-Comp Proceedings
ISSN 1759-3433
CCP: 57
Edited by: B.H.V. Topping
Paper II.1

Multilevel Mesh Partitioning for Optimising Subdomain Aspect Ratio

C. Walshaw*, M. Cross*, R. Diekmann+ and F. Schlimbach*

*Centre for Numerical Modelling and Process Analysis, University of Greenwich, London, England
+Corporate Research, Hilti AG, Schaan, Liechtenstein

Full Bibliographic Reference for this paper
C. Walshaw, M. Cross, R. Diekmann, F. Schlimbach, "Multilevel Mesh Partitioning for Optimising Subdomain Aspect Ratio", in B.H.V. Topping, (Editor), "Developments in Computational Mechanics with High Performance Computing", Civil-Comp Press, Edinburgh, UK, pp 9-19, 1999. doi:10.4203/ccp.57.2.1
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.

purchase the full-text of this paper (price £20)

go to the previous paper
go to the next paper
return to the table of contents
return to the book description
purchase this book (price £70 +P&P)