Online Load Balancing Made Simple: Greedy Strikes Back

  • Pilu Crescenzi
  • Giorgio Gambosi
  • Gaia Nicosia
  • Paolo Penna
  • Walter Unger
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2719)

Abstract

We provide a new simpler approach to the on-line load balancing problem in the case of restricted assignment of temporary weighted tasks. The approach is very general and allows to derive online distributed algorithms whose competitive ratio is characterized by some combinatorial properties of the underlying graph representing the problem.

The effectiveness of our approach is shown by the hierarchical server model introduced by Bar-Noy et al ’99. In this case, our method yields simpler and distributed algorithms whose competitive ratio is at least as good as the existing ones. Moreover, the resulting algorithms and their analysis turn out to be simpler. Finally, in all cases the algorithms are optimal up to a constant factor.

Some of our results are obtained via a combinatorial characterization of those graphs for which our technique yields O(\( \sqrt n \))-competitive algorithms.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Albers. Better bounds for on-line scheduling. Proc. of the 29th ACM Symp. on Theory of Computing (STOC), pages 130–139, 1997.Google Scholar
  2. 2.
    Y. Azar. On-line load balancing, chapter in “On-line Algorithms-The state of the Art”, A. Fiat and G. Woeginger (eds.). Springer Verlag, 1998.Google Scholar
  3. 3.
    Y. Azar, A. Broder, and A. Karlin. Online load balancing. Theoretical Computer Science, 130:73–84, 1994.MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Y. Azar and L. Epstein. On-line load balancing of temporary tasks on identical machines. Proc. of the 5th Israeli Symposium on Theory of Computing and Systems (ISTCS), pages 119–125, 1997.Google Scholar
  5. 5.
    Y. Azar, B. Kalyanasundaram, S. Plotkin, K. Pruhs, and O. Waarts. Online load balancing of temporary tasks. Journal of Algorithms, 22:93–110, 1997.MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Y. Azar, J. Naor, and R. Rom. The competitiveness of online assignments. Journal of Algorithms, 18:221–237, 1995.MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    A. Bar-Noy, A. Freund, and J. Naor. On-line load balancing in a hierarchical server topology. SIAM Journal on Computing, 31(2):527–549, 2001. Preliminary version in Proc. of the 7th Annual European Symposium on Algorithms, ESA’99.MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    D. Braess. Ueber ein Paradoxon aus der Verkehrsplanung. Unternehmensforschung, 12:258–268, 1968.MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    P. Crescenzi, G. Gambosi, and P. Penna. On-line algorithms for the channel assignment problem in cellular networks. In Proc. of the 4th ACM International Workshop on Discrete Algorithms and Methods for Mobile Computing (DIALM), pages 1–7, 2000. Full version to appear in Discrete Applied Mathematics.Google Scholar
  10. 10.
    P. Crescenzi, G. Gambosi, and P. Penna. On-line load balancing made simple: Greedy strikes back. Technical report, Università di Salerno, 2003. Electronic version available at http://www.dia.unisa.it/~penna.Google Scholar
  11. 11.
    R. Graham. Bounds for certain multiprocessor anomalies. Bell System Technical Journal, 45:1563–1581, 1966.Google Scholar
  12. 12.
    R. Graham. Bounds on multiprocessor timing anomalies. SIAM J. Appl. Math., 17:263–269, 1969.Google Scholar
  13. 13.
    S. Guha and S. Khuller. Greedy strikes back: Improved facility location algorithms. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 1998.Google Scholar
  14. 14.
    E. Tardòs J.K. Lenstra, D.B. Shmoys. Approximation algorithms for scheduling unrelated parallel machines. Math. Programming, 46:259–271, 1990.MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    J. D. Murchland. Braess’s paradox of traffic flow. Transportation Research, 4:391–394, 1070.CrossRefGoogle Scholar
  16. 16.
    S. Phillips and J. Westbrook. Online load balancing and network flow. Algorithmica, 21(3):245–261, 1998.MATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Serge Y. Ma and A. Plotkin. An improved lower bound for load balancing of tasks with unknown duration. Information Processing Letters, 62(6):301–303, 1997.CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Pilu Crescenzi
    • 1
  • Giorgio Gambosi
    • 2
  • Gaia Nicosia
    • 3
  • Paolo Penna
    • 4
  • Walter Unger
    • 5
  1. 1.Dipartimento di Sistemi ed InformaticaUniversità di FirenzeFirenzeItaly
  2. 2.Dipartimento di MatematicaUniversità di Roma “Tor Vergata”RomaItaly
  3. 3.Dipartimento di Informatica e AutomazioneUniversità degli studi “Roma Tre”RomaItaly
  4. 4.Dipartimento di Informatica ed Applicazioni “R.M. Capocelli”Università di SalernoBaronissi (SA)Italy
  5. 5.RWTH AachenAachenGermany

Personalised recommendations