Fast algorithms for fair dynamic load redistribution in heterogeneous environments Original Research Article

Efficiently running parallel applications on distributed computing environments requires adequate fair dynamic load redistribution techniques. In this paper, two fast algorithms for maintaining the fairness in a dynamic heterogeneous context are discussed. The first algorithm is based upon a conjugate gradient method and solves a quadratic optimization problem. The second algorithm finds the solution of the same problem using the characteristic polynomial of the generalized Laplacian of the communication graph. Both algorithms are faster than the well-known diffusion algorithms. Experimental results are reported.