Parallel partitioning of unstructured meshes
Walshaw, C. ORCID: 0000-0003-0253-7779, Cross, M. and Everett, M. G.
(1997)
Parallel partitioning of unstructured meshes.
In: Parallel Computational Fluid Dynamics: Algorithms and Results Using Advanced Computers.
Elsevier B.V., pp. 174-181.
ISBN 978-0-444-82327-4
(doi:https://doi.org/10.1016/B978-044482327-4/50088-7)
Abstract
A method is outlined for optimising graph partitions which arise in mapping un- structured mesh calculations to parallel computers. The method employs a combination of iterative techniques to both evenly balance the workload and minimise the number and volume of interprocessor communications. They are designed to work efficiently in parallel as well as sequentially and when combined with a fast direct partitioning technique (such as the Greedy algorithm) to give an initial partition, the resulting two-stage process proves itself to be both a powerful and flexible solution to the static graph-partitioning problem. The algorithms can also be used for dynamic load-balancing and a clustering technique can additionally be employed to speed up the whole process. Experiments indicate that the resulting parallel code can provide high quality partitions, independent of the initial partition, within a few seconds.
Item Type: | Conference Proceedings |
---|---|
Title of Proceedings: | Parallel Computational Fluid Dynamics: Algorithms and Results Using Advanced Computers |
Pre-2014 Departments: | School of Computing & Mathematical Sciences |
Last Modified: | 14 Oct 2016 09:00 |
URI: | http://gala.gre.ac.uk/id/eprint/385 |
Actions (login required)
![]() |
View Item |