An online load balancing problem where there are identical machines (servers) and a sequence of jobs is presented. The jobs arrive one by one and should be assigned to one of the machines in an online fashion. The sum (over all machines) of the squares of the loads must be minimized instead of the traditional maximum load. For sum of the squares, the greedy algorithm performs within 4/3 of the optimum, and no online algorithm achieves a better competitive ratio. The performance of greedy is not monotone in the number of machines. The competitive ratio is 4/3 for any number of machines divisible by 3 but strictly less than 4/3 in all other cases.
|Number of pages
|Published - 1998
|Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA
Duration: 25 Jan 1998 → 27 Jan 1998
|Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms
|San Francisco, CA, USA
|25/01/98 → 27/01/98