Multilevel Mesh Partitioning for Optimizing Domain Shape

Authors:
C. Walshaw;M. Cross;R. Diekmann;F. Schlimbach
Affiliations:
School of Computing and Mathematical Sciences, University of Greenwich, London, U.K.;School of Computing and Mathematical Sciences, University of Greenwich, London, U.K.;Hilti AG, Corporate Research, FL-9494 Schaan, Principality of Liechtenstein;School of Computing and Mathematical Sciences, University of Greenwich, London, U.K.
Venue:
International Journal of High Performance Computing Applications
Year:
1999

Citing 8
Cited 6

The construction of preconditioners for elliptic problems by substructuring. I

Mathematics of Computation
Quality mesh generation in three dimensions

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
A multilevel algorithm for partitioning graphs

Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Fast and effective algorithms for graph partitioning and sparse-matrix ordering

IBM Journal of Research and Development - Special issue: optical lithography I
Parallel dynamic graph partitioning for adaptive unstructured meshes

Journal of Parallel and Distributed Computing - Special issue on dynamic load balancing
Quality Balancing for Parallel Adaptive FEM

IRREGULAR '98 Proceedings of the 5th International Symposium on Solving Irregularly Structured Problems in Parallel
Multilevel Mesh Partitioning for Optimising Aspect Ratio

VECPAR '98 Selected Papers and Invited Talks from the Third International Conference on Vector and Parallel Processing
A linear-time heuristic for improving network partitions

DAC '82 Proceedings of the 19th Design Automation Conference

A new graph representation for cable-membrane structures

Advances in Engineering Software
Parallel mesh-partitioning algorithms for generating shape optimised partitions using evolutionary computing

Advances in Engineering Software
Distributed evolutionary multi-objective mesh-partitioning algorithm for parallel finite element computations

Computers and Structures
Accelerating shape optimizing load balancing for parallel fem simulations by algebraic multigrid

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A shape optimizing load distribution heuristic for parallel adaptive FEM computations

PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
The impact of heterogeneous multi-core clusters on graph partitioning: an empirical study

Cluster Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multilevel algorithms are a successful class of optimization techniques that address the mesh partitioning problem for mapping meshes onto parallel computers. They usually combine a graph contraction algorithm together with a lo-cal optimization method that refines the partition at each graph level. To date, these algorithms have been used al-most exclusively to minimize the cut-edge weight in the graph with the aim of minimizing the parallel communication overhead. However, it has been shown that for certain classes of problems, the convergence of the underlying solution algorithm is strongly influenced by the shape or aspect ratio of the subdomains. Therefore, in this paper, the authors modify the multilevel algorithms to optimize a cost function based on the aspect ratio. Several variants of the algorithms are tested and shown to provide excellent results.