On-Line Load Balancing of Temporary Tasks on Identical Machines

@article{Azar2004OnLineLB,
  title={On-Line Load Balancing of Temporary Tasks on Identical Machines},
  author={Yossi Azar and Leah Epstein},
  journal={SIAM J. Discrete Math.},
  year={2004},
  volume={18},
  pages={347-352}
}
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 logm logm ) for general m. 

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Bounds on Multiprocessing Timing Anomalies

SIAM Journal of Applied Mathematics • 1969
View 4 Excerpts
Highly Influenced

Bounds for certain multiprocessor anomalie s

R. Graham
Bell System Technical Journal, • 1966
View 4 Excerpts
Highly Influenced

On-Line Load Balancing

Theor. Comput. Sci. • 1994
View 2 Excerpts

Similar Papers

Loading similar papers…