On-line load balancing in a hierarchical server topology

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1643, Issue , 1999, Pages 77-88

  Bar Noy, Amotz ^a   Freund, Ari ^b   Naor, Joseph Seffi ^b,c  

^a TEL AVIV UNIVERSITY   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPETITIVE RATIO; LINE LOADS; LINEAR HIERARCHIES; ON-LINE FASHION; TOTAL LOAD; UPPER AND LOWER BOUNDS;

NETWORK MANAGEMENT;

EID: 84958041247     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48481-7_8     Document Type: Conference Paper

References (12)

1. S. Albers. Better bounds for online scheduling. Proc. 29th ACM Symp. On Theory of Computing, pp. 130–139, 1997.
2. J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waartz. On-line machine scheduling with applications to load balancing and virtual circuit routing. Journal of the ACM, 44:486–504, 1997.
3. Y. Azar. On-line load balancing. On-line Algorithms: The State of the Art, Eds. A. Fiat and G.Woeginger, LNCS 1442, pp. 178–195, Springer, 1998.
4. Y. Azar, A. Broder, and A. Karlin. On-line load balancing. Proc. 33rd IEEE Symp. On Foundations of Computer Science, pp. 218–225, 1992.
5. Y. Azar, B. Kalyanasundaram, S. Plotkin, K. Pruhs, and O. Waarts. On-line load balancing of temporary tasks. Journal of Algorithms, Vol. 22, pp. 93–110, 1997.
6. Y. Azar, J. Naor, and R. Rom. The competitiveness of on-line assignments. Journal of Algorithms, Vol. 18, pp. 221–237, 1995.
7. Y. Bartal, A. Fiat, H. Karloff, and R. Vohra. Newalgorithms for an ancient scheduling problem. Proc. 24th ACM Symp. On Theory of Computing, pp. 51–58, 1992.
8. Y. Bartal, H.J. Karloff, and Y. Rabani. A Better Lower Bound for On-line Scheduling. Information Processing Letters, 50:113–116, 1994.
9. th International Workshop on Algorithms and Data Structures’97, LNCS 1272, pp. 116–125, Springer, 1997.
10. R. Graham. Bounds for certain multiprocessor anomalies. Bell System Technical Journal, Vol. 45, pp. 1563–1581, 1966.
11. D. R. Karger, S. J. Phillips, and E. Torng. Abetter algorithm for an ancient scheduling problem. Proc. 5th ACM-SIAM Symp. On Discrete Algorithms, pp. 132–140, 1994.
12. J. Sgall. On-line scheduling. On-line Algorithms: The State of the Art, Eds. A. Fiat and G.Woeginger, LNCS 1442, pp. 196–231, Springer, 1998.