Skip to main content
SpringerLink
Log in

Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios

  • Conference paper
  • First Online:
Book cover STACS 2001 (STACS 2001)

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

Included in the following conference series:

  • 628 Accesses

Abstract

We study preemptive scheduling on uniformly related pro- cessors, where jobs are arriving one by one in an on-line fashion. We consider the class of machine sets where the speed ratios are non- decreasing as speed increases. For each set of machines in this class, we design an algorithm of optimal competitive ratio. This generalizes the known result for identical machines, and solves other interesting cases.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Y. Bartal, A. Fiat, H. Karloff, and R. Vohra. New algorithms for an ancient scheduling problem. J. Comput. Syst. Sci., 51(3):359–366, 1995.

    Article  MathSciNet  Google Scholar 

  2. B. Chen, A. van Vliet, and G. J. Woeginger. Lower bounds for randomzed online scheduling. Information Processing Letters, 51:219–222, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  3. B. Chen, A. van Vliet, and G. J. Woeginger. An optimal algorithm for preemptive on-line scheduling. Operations Research Letters, 18:127–131, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  4. L. Epstein, J. Noga, S.S. Seiden, J. Sgall, and G.J. Woeginger. Randomized online scheduling on two uniform machines. In Annual ACM-SIAM Symposium on Discrete Algorithms, pages 317–326, 1999. To appear in Journal of Scheduling.

    Google Scholar 

  5. L. Epstein and J. Sgall. A lower bound for on-line scheduling on uniformly related machines. Oper. Res. Lett., 26(1):17–22, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  6. T. F. Gonzales and S. Sahni. Preemptive scheduling of uniform processor systems. J. Assoc. Comput. Mach., 25:92–101, 1978.

    MathSciNet  Google Scholar 

  7. E. Horwath, E. C. Lam, and R. Sethi. A level algorithm for preemptive scheduling. J. Assoc. Comput. Mach., 24:32–43, 1977.

    MathSciNet  Google Scholar 

  8. J. Sgall. A lower bound for randomized on-line multiprocessor scheduling. Inf. Process. Lett., 63(1):51–55, 1997.

    Article  MathSciNet  Google Scholar 

  9. J. Sgall. On-line scheduling. In A. Fiat and G. J. Woeginger, editors, Online Algorithms: The State of the Art, volume 1442 of LNCS, pages 196–231. Springer-Verlag, 1998.

    Chapter  Google Scholar 

  10. A. P. A. Vestjens. Scheduling uniform machines on-line requires nondecreasing speed ratios. Technical Report Memorandum COSOR 94-35, Eindhoven University of Technology, 1994. To appear in Math. Programming.

    Google Scholar 

  11. J. Wen and D. Du. Preemptive on-line scheduling for two uniform processors. Oper. Res. Lett., 23:113–116, 1998.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer and Media Sciences, The Interdisciplinary Center, P.O.B. 167, 46150, Herzliya, Israel

    Leah Epstein

Authors
  1. Leah Epstein
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. I3S & INRIA Sophia Antipolis INRIA, CNRS, 2004 Route des Lucioles, 06902, Sophia-Antipolis, France

    Afonso Ferreira

  2. Institut für Theoretische Informatik, Fakultät Informatik, TU Dresden, 01062, Dresden, Germany

    Horst Reichel

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Epstein, L. (2001). Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios. In: Ferreira, A., Reichel, H. (eds) STACS 2001. STACS 2001. Lecture Notes in Computer Science, vol 2010. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44693-1_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-44693-1_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41695-1

  • Online ISBN: 978-3-540-44693-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation