Walshaw, C. ORCID: 0000-0003-0253-7779 and Cross, M. (2000) Parallel optimisation algorithms for multilevel mesh partitioning. Parallel Computing, 26 (12). pp. 1635-1660. ISSN 0167-8191 (doi:https://doi.org/10.1016/S0167-8191(00)00046-6)

Full text not available from this repository.

Abstract

Three parallel optimisation algorithms, for use in the context of multilevel graph partitioning of unstructured meshes, are described. The first, interface optimisation, reduces the computation to a set of independent optimisation problems in interface regions. The next, alternating optimisation, is a restriction of this technique in which mesh entities are only allowed to migrate between subdomains in one direction. The third treats the gain as a potential field and uses the concept of relative gain for selecting appropriate vertices to migrate. The results are compared and seen to produce very high global quality partitions, very rapidly. The results are also compared with another partitioning tool and shown to be of higher quality although taking longer to compute.

Item Type:	Article
Uncontrolled Keywords:	mesh partitioning, load-balancing, multilevel algorithms
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 09:00
URI:	http://gala.gre.ac.uk/id/eprint/414

Actions (login required)

View Item