Skip navigation

Parallel dynamic graph-partitioning for unstructured meshes

Parallel dynamic graph-partitioning for unstructured meshes

Walshaw, C. ORCID: 0000-0003-0253-7779, Cross, M. and Everett, M. (1997) Parallel dynamic graph-partitioning for unstructured meshes. Technical Report. CMS Press, London, UK.

Full text not available from this repository.

Abstract

A parallel method for the dynamic partitioning of unstructured meshes is described. The method introduces a new iterative optimisation technique known as relative gain optimisation 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 rapidly. Perhaps more importantly, the algorithm results in only a small fraction of the amount of data migration compared to the static partitioners.

Item Type: Monograph (Technical Report)
Additional Information: Mathematics Research Report 97/IM/20. ISBN: 1 899991 20 4. This paper was also published in Journal of Parallel and Distributed Computing, 47 (2). pp. 102-108, 1997 (available from this repository).
Uncontrolled Keywords: graph-partitioning, adaptive unstructured meshes, load-balancing, parallel computing
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/410

Actions (login required)

View Item View Item