article
Fair online load balancing
Niv Buchbindera b✉, Joseph Seffi Naora c
- aOpen Univestity, Ra’anana, Israel
- bOpen Univestity, Ra'anana, Israel#TAB#
- cComputer Science Department, Technion, , Haifa, Israel 32000#TAB#
- ✉Corresponding author
Looking for the full paper…
Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.
Abstract
No abstract is available from our sources. Use “Read paper” to view it.
TL;DRThis work revisits from a fairness point of view the problem of online load balancing in the restricted assignment model and the 1-∞ model and proves that the greedy algorithm yields an assignment that is globally O(log m)-balanced for the 1-∞ model. (Semantic Scholar)