Ancient and new algorithms for load balancing in the Lp norm

Adi Avidor*, Yossi Azar, Jiri Sgall

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

Abstract

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.

Original languageEnglish
Pages426-434
Number of pages9
StatePublished - 1998
EventProceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA
Duration: 25 Jan 199827 Jan 1998

Conference

ConferenceProceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms
CitySan Francisco, CA, USA
Period25/01/9827/01/98

Fingerprint

Dive into the research topics of 'Ancient and new algorithms for load balancing in the Lp norm'. Together they form a unique fingerprint.

Cite this