Sciweavers

SPAA
2003
ACM

The load rebalancing problem

13 years 9 months ago
The load rebalancing problem
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty processors. A typical objective is to minimize makespan, the load on the heaviest loaded processor. Since in most real world scenarios the load is a dynamic measure, the initial assignment may be not remain optimal with time. Motivated by such considerations in a variety of systems, we formulate the problem of load rebalancing — given a possibly suboptimal assignment of jobs to processors, relocate a set of the jobs so as to decrease the makespan. Specifically, the goal is to achieve the best possible makespan under the constraint that no more than k jobs are relocated. We also consider a generalization of this problem where there is an arbitrary cost function associated with each job relocation. Since the problem is clearly NP-hard, we focus on approximation algorithms. We construct a sophisticated algorithm
Gagan Aggarwal, Rajeev Motwani, An Zhu
Added 05 Jul 2010
Updated 05 Jul 2010
Type Conference
Year 2003
Where SPAA
Authors Gagan Aggarwal, Rajeev Motwani, An Zhu
Comments (0)