The issue of the dynamic load balancing of unstructured adaptive meshes is discussed. Experimental results are used to suggest the need for a new metric for dynamic load balancing. The metric is derived by extending the constrained minimisation approach of Hu and Blake Y.F. Hu, R.J. Blake, Concurrency: Practice and Experience 10(6) (1998) 467-483 to an unconstrained minimisation problem. Simple examples are used to demonstrate the effectiveness of this approach for both the determination of the amount of communications traffic between processors and for the more detailed graph partitioning of a mesh. (C) 2000 Elsevier Science Inc. All rights reserved. References: 14
展开▼
