Ancient and new algorithms for load balancing in the ℓp norm

Algorithmica (New York)

Volumn 29, Issue 3, 2001, Pages 422-441

  Avidor, A ^a   Azar, Y ^a   Sgall, J ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b MATHEMATICAL INSTITUTE   (Czech Republic)

Author keywords

Competitive ratio; Load balancing; On line; Scheduling

Indexed keywords

ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

LOAD BALANCING;

SERVERS;

EID: 0038722478     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004530010051     Document Type: Article

References (12)

1. S. Albers. Better bounds for on-line scheduling. In Proc. 29th ACM Symp. on Theory of Computing, pages 130-139, 1997.
2. N. Alon, Y. Azar, G. Woeginger, and T. Yadid. Approximation schemes for scheduling. In Proc. 8th ACM-SIAM Symp. on Discrete Algorithms, pages 493-500, 1997.
3. J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts. On-line load balancing with applications to machine scheduling and virtual circuit routing. In Proc. 25th ACM Symp. on the Theory of Computing, pages 623-631, 1993.
4. p norm. In Proc. 36th IEEE Symp. on Foundations of Computer Science, pages 383-391, 1995.
5. Y. Bartal, A. Fiat, H. Karloff, and R. Vorha. New algorithms for an ancient scheduling problem. In Proc. 24th ACM Symp. on Theory of Computing, pages 51-58, 1992.
6. A. K. Chandra and C. K. Wong. Worst-case analysis of a placement algorithm related to storage allocation. SIAM Journal on Computing, 4(3):249-263, 1975.
7. B. Chen, A. van Vliet, and G. Woeginger. New lower and upper bounds for on-line scheduling. Operations Research Letters, 16:221-230, 1994.
8. R. A. Cody and E. G. Coffman, Jr. Record allocation for minimizing expected retrieval costs on drum-like storage devices. Journal of the Association for Computing Machinery, 23(1):103-115, January 1976.
9. G. Galambos and G. Woeginger. An on-line scheduling heuristic with better worst case ratio than Graham's list scheduling. Siam Journal on Computing, 22(2):349-355, 1993.
10. M. R. Garey and D. S. Johnson. Computers and Intractability. Freeman, San Francisco, CA, 1979.
11. R. L. Graham. Bounds for certain multiprocessor anomalies. Bell Systems Technical Journal, 45:1563-1581, 1966.
12. J. Y. T. Leung and W. D. Wei. Tighter bounds on a heuristic for a partition problem. Information Processing Letters, 56:51-57, 1995.