Dynamic mesh partitioning & load-balancing for parallel computational mechanics codes

C. Walshaw and M. Cross


We discuss the load-balancing issues arising in parallel mesh based computational mechanics codes for which the processor loading changes during the run. We briefly touch on geometric repartitioning ideas and then focus on different ways of using a graph both to solve the load-balancing problem and the optimisation problem, both locally and globally. We also briefly discuss whether repartitioning is always valid. Sample illustrative results are presented and we conclude that repartitioning is an attractive option if the load changes are not too dramatic and that there is a certain trade-off between partition quality and volume of data that the underlying application needs to migrate.

Key words. graph partitioning, mesh partitioning, load-balancing, multilevel algorithms.

Fri Aug 13 13:40:02 BST 2004