Walshaw, C. ORCID: 0000-0003-0253-7779, Cross, M. and Everett, M.G. (1997) Parallel dynamic graph-partitioning for unstructured meshes. Journal of Parallel and Distributed Computing, 47 (2). pp. 102-108. ISSN 0743-7315 (doi:https://doi.org/10.1006/jpdc.1997.1407)

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 optimization technique known as relative gain optimization which both balances the workload and attempts to minimize 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:	Article
Uncontrolled Keywords:	graph-partitioning, adaptive unstructured meshes, load-balancing, parallel computing
Subjects:	Q Science > QA Mathematics > QA76 Computer software
Pre-2014 Departments:	School of Computing & Mathematical Sciences School of Computing & Mathematical Sciences > Centre for Numerical Modelling & Process Analysis School of Computing & Mathematical Sciences > Centre for Numerical Modelling & Process Analysis > Computational Science & Engineering Group School of Computing & Mathematical Sciences > Computer & Computational Science Research Group School of Computing & Mathematical Sciences > Department of Computer Science School of Computing & Mathematical Sciences > Department of Mathematical Sciences
Related URLs:	Publisher Organisation
Last Modified:	14 Oct 2016 08:59
URI:	http://gala.gre.ac.uk/id/eprint/44

Actions (login required)

View Item