Scalable unstructured mesh decomposition
McManus, K., Johnson, S., Walshaw, C. ORCID: https://orcid.org/0000-0003-0253-7779, Cross, M. and Chow, P.
(1998)
Scalable unstructured mesh decomposition.
In: 8th International Parallel Computing Workshop, 7 - 8 September 1998, National University of Singapore, Singapore.
Abstract
As the efficiency of parallel software increases it is becoming common to measure near linear speedup for many applications. For a problem size N on P processors then with software running at O(N=P ) the performance restrictions due to file i/o systems and mesh decomposition running at O(N) become increasingly apparent especially for large P . For distributed memory parallel systems an additional limit to scalability results from the finite memory size available for i/o scatter/gather operations. Simple strategies developed to address the scalability of scatter/gather operations for unstructured mesh based applications have been extended to provide scalable mesh decomposition through the development of a parallel graph partitioning code, JOSTLE [8]. The focus of this work is directed towards the development of generic strategies that can be incorporated into the Computer Aided Parallelisation Tools (CAPTools) project.
Item Type: | Conference or Conference Paper (Paper) |
---|---|
Pre-2014 Departments: | School of Computing & Mathematical Sciences |
Last Modified: | 14 Oct 2016 09:00 |
URI: | http://gala.gre.ac.uk/id/eprint/402 |
Actions (login required)
![]() |
View Item |