An optimal migration algorithm for dynamic load balancing

The problem of redistributing the work load on parallel computers is considered. An optimal redistribution algorithm, which minimises the Euclidean norm of the migrating load, is derived. The relationship between this algorithm and some existing algorithms is discussed and the convergence of the new algorithm is studied. Finally, numerical results on randomly generated graphs as well as on graphs related to real meshes are given to demonstrate the effectiveness of the new algorithm. © 1998 John Wiley & Sons, Ltd.