Skip navigation

Dynamic load-balancing for parallel adaptive unstructured meshes

Dynamic load-balancing for parallel adaptive unstructured meshes

Walshaw, C. ORCID: 0000-0003-0253-7779, Cross, M. and Everett, M. (1997) Dynamic load-balancing for parallel adaptive unstructured meshes. In: Parallel Processing for Scientific Computing (SIAM), 1997, Philadelphia, PA, USA.

Full text not available from this repository.

Abstract

A parallel method for dynamic partitioning of unstructured meshes is described. The method employs a new iterative optimisation technique which both balances the workload and attempts to minimise the interprocessor communications overhead. Experiments on a series of adaptively refined meshes indicate that the algorithm provides partitions of an equivalent or higher quality to static partitioners (which do not reuse the existing partition) and much more quickly. Perhaps more importantly, the algorithm results in only a small fraction of the amount of data migration compared to the static partitioners.

Item Type: Conference or Conference Paper (Paper)
Additional Information: Publication made on CD-ROM
Uncontrolled Keywords: graph-partitioning, adaptive unstructured meshes, load-balancing, parallel scientific computation
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/384

Actions (login required)

View Item View Item