C. Walshaw, M. Cross and M. G. Everett
In: Parallel Processing for Scientific Computing, M. Heath et al., eds., SIAM, 1997.
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.
Key words. graph-partitioning, adaptive unstructured meshes, load-balancing, parallel scientific computation.