Abstract
We prove an exact lower bound of 2-1/m on the competitive ratio of any deterministic algorithm for load balancing of temporary tasks on m identical machines. We also show a lower bound of 2-1/m for randomized algorithms for small m and 2-2/m+1 for general m. If in addition, we restrict the sequence to polynomial length, then the lower bound for randomized algorithms becomes 2-O(log log m/log m) for general m.
| Original language | English |
|---|---|
| Pages | 119-125 |
| Number of pages | 7 |
| State | Published - 1997 |
| Event | Proceedings of the 1997 5th Israel Symposium on Theory of Computing and Systems, ISTCS - Ramat-Gan, Isr Duration: 17 Jun 1997 → 19 Jun 1997 |
Conference
| Conference | Proceedings of the 1997 5th Israel Symposium on Theory of Computing and Systems, ISTCS |
|---|---|
| City | Ramat-Gan, Isr |
| Period | 17/06/97 → 19/06/97 |