On-Line Load Balancing of Temporary Tasks Revisited

  • Kar-Keung To
  • Wai-Ha Wong
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1741)


We study load balancing problems with temporary jobs (i.e., jobs that arrive and depart at unpredictable time) in two different con- texts, namely, machines and network paths. Such problems are known as machine load balancing and virtual circuit routing in the literature. We present new on-line algorithms and improved lower bounds.


Competitive Ratio Online Algorithm Competitive Algorithm Interval Model Virtual Circuit 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    M. Andrews, M. X. Goemans, and L. Zhang. Improved bounds for on-line load balancing. In Proceedings of the Second Annual International Computing and Combinatorics Conference, pages 1–10, 1996.Google Scholar
  2. [2]
    J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts. On-line routing of virtual circuits with applications to load balancing and machine scheduling. Journal of the ACM, 44(3):486–504, 1997.zbMATHCrossRefMathSciNetGoogle Scholar
  3. [3]
    B. Awerbuch, Y. Azar, S. Plotkin, and O. Waarts. Competitiveness routing of virtual circuits with unknown duration. In Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 321–327, 1994.Google Scholar
  4. [4]
    Y. Azar. On-line load balancing. In Online Algorithms: the state of the art, Lecture notes in computer science; 1442, Springer, pages 178–195, 1998.CrossRefGoogle Scholar
  5. [5]
    Y. Azar, A. Z. Broder, and A. R. Karlin. On-line load balancing. In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pages 218–225, 1992.Google Scholar
  6. [6]
    Y. Azar and L. Epstein. On-line load balancing of temporary tasks on identical machines. In 5th Israeli Symposium on Theory of Computing and Systems, pages 119–125, 1997.Google Scholar
  7. [7]
    Y. Azar, B. Kalyanasundaram, S. Plotkin, K. R. Pruhs, and O. Waarts. On-line load balancing of temporary tasks. Journal of Algorithms, 22:93–110, 1997.zbMATHCrossRefMathSciNetGoogle Scholar
  8. [8]
    Y. Azar, J. S. Naor, and R. Rom. Competitiveness of on-line assignments. Journal of Algorithms, 18:221–237, 1995.zbMATHCrossRefMathSciNetGoogle Scholar
  9. [9]
    A. Bar-Noy, A. Freund, and J. Naor. Online load balancing in a hierarchical server topology. In Proceedings of the Seventh Annual European Symposium on Algorithm, pages 77–88, 1999.Google Scholar
  10. [10]
    P. Berman, M. Charikar, and M. Karpinski. On-line load balancing for related machines. In Workshop on Algorithms and Data Structures, pages 116–125, 1997.Google Scholar
  11. [11]
    A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.Google Scholar
  12. [12]
    Y. Cho and S. Sahni. Bounds for list schedules on uniform processors. SIAM Journal on Computing, 9(1):91–103, 1980.zbMATHCrossRefMathSciNetGoogle Scholar
  13. [13]
    G. Galambos and B. J. 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.zbMATHCrossRefMathSciNetGoogle Scholar
  14. [14]
    R. L. Graham. Bounds for certain multiprocessing anomalies. Bell System Technical Journal, 45:1563–1581, 1966.Google Scholar
  15. [15]
    Y. Ma and S. Plotkin. An improved lower bound for load balancing of tasks with unknown duration. Information Processing Letters, 62(6):301–303, 1997.CrossRefMathSciNetGoogle Scholar
  16. [16]
    S. Phillips and J. Westbrook. Online load balancing and network flow. In Proceedings of the Twenty-Fifth Annual Symposium on Theory of Computing, pages 402–411, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Kar-Keung To
    • 1
  • Wai-Ha Wong
    • 1
  1. 1.Deptartment of Computer Science and Information SystemsThe University of Hong KongHong Kong

Personalised recommendations