Skip to main content
SpringerLink
Log in

On-line load balancing for related machines

  • Session 4B: Invited Lecture
  • Conference paper
  • First Online:
Algorithms and Data Structures (WADS 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1272))

Included in the following conference series:

Abstract

We consider the problem of scheduling permanent jobs on related machines in an on-line fashion. We design a new algorithm that achieves the competitive ratio of 3 + √8 ≈ 5.828 for the deterministic version, and 3.31/ln 2.155 ≈ 4.311 for its randomized variant, improving the previous competitive ratios of 8 and 2e ≈ 5.436. We also prove lower bounds of 2.4380 on the competitive ratio of deterministic algorithms and 1.8372 on the competitive ratio of randomized algorithms for this problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Albers, Better bounds for online scheduling, Proc. 29th ACM STOC (1997), pp. 130–139.

    Google Scholar 

  2. J. Aspnes, Y. Azar, A. Fiat, S. Plotkin and O. Waarts, On-line load balancing with applications to machine scheduling and virtual circuit routing, Proc. 25th ACM STOC(1993), pp. 623–631.

    Google Scholar 

  3. Y. Azar, A. Broder, A. Karlin, On-line load balancing, Proc. 33rd IEEE FOCS (1992), pp. 218–225.

    Google Scholar 

  4. Y. Azar, J. Naor, R. Rom, The competitiveness of on-line assignment, Proc. 3rd ACM-SIAM SODA (1992), pp. 203–210.

    Google Scholar 

  5. A. Beck and D. Newman, Yet more on the linear search problem, Israel Journal of Math., 8:419–429, 1970.

    Google Scholar 

  6. S. Chakrabarti, C. Phillips, A. Schulz, D.B. Shmoys, C. Stein, and J. Wein, Improved scheduling algorithms for minsum criteria, Proc. 23rd ICALP, Springer, 1996.

    Google Scholar 

  7. B. Chen, A. van Vliet and G. J. Woeginger, A lower bound for randomized on-line scheduling algorithms, Information Processing Letters, vol.51, no.5, pp. 1970, 219–22.

    Google Scholar 

  8. P. Indyk, personal communication.

    Google Scholar 

  9. S. Gal, Search Games, Academic Press, 1980.

    Google Scholar 

  10. M. Goemans and J. Kleinberg, An improved approximation ratio for the minimum latency problem, Proc. 7th ACM-SIAM SODA, (1996), pp. 152–157.

    Google Scholar 

  11. R. L. Graham, Bounds for certain multiprocessing anomalies, Bell System Technical Journal 45 (1966), pp. 1563–1581.

    Google Scholar 

  12. R. Motwani, S. Phillips and E. Torng, Non-clairvoyant scheduling, Proc. 4th ACMS-IAM SODA (1993), pp. 422–431, see also: Theoretical Computer Science, 130 (1994), pp. 17–47.

    Google Scholar 

  13. A.C. Yao, Probabilistic computations: Towards a unified measure of complexity, Proc. 17th IEEE FOGS (1977), pp. 222–227.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Pennsylvania State University, 16802, University Park, PA, USA

    Piotr Berman

  2. Stanford University, 94305-9045, Stanford, CA

    Moses Charikar

  3. International Computer Science Institute, University of Bonn, 53117 Bonn, Berkeley

    Marek Karpinski

Authors
  1. Piotr Berman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Moses Charikar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marek Karpinski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Frank Dehne Andrew Rau-Chaplin Jörg-Rüdiger Sack Roberto Tamassia

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berman, P., Charikar, M., Karpinski, M. (1997). On-line load balancing for related machines. In: Dehne, F., Rau-Chaplin, A., Sack, JR., Tamassia, R. (eds) Algorithms and Data Structures. WADS 1997. Lecture Notes in Computer Science, vol 1272. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63307-3_52

Download citation

  • DOI: https://doi.org/10.1007/3-540-63307-3_52

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63307-5

  • Online ISBN: 978-3-540-69422-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation