ACM Computing Surveys (CSUR)
Theoretical Computer Science
Temporary tasks assignment resolved
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On-line load balancing of temporary tasks revisited
Theoretical Computer Science
Off-line temporary tasks assignment
Theoretical Computer Science
On-line restricted assignment of temporary tasks with unknown durations
Information Processing Letters
Resource Augmentation in Load Balancing
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
On-Line Load Balancing of Temporary Tasks Revisited
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Off-Line Temporary Tasks Assignment
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
On-line algorithms for the channel assignment problem in cellular networks
Discrete Applied Mathematics
Tight bounds for online class-constrained packing
Theoretical Computer Science - Latin American theorotical informatics
On-line load balancing made simple: Greedy strikes back
Journal of Discrete Algorithms
Online load balancing made simple: greedy strikes back
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
| Hi-index | 0.00 |
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.