Skip to main content
SpringerLink
Log in
Book cover

European Symposium on Algorithms

ESA 1998: Algorithms — ESA’ 98 pp 235–246Cite as

Maximizing Job Completions Online

  • Conference paper
  • First Online:

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

Abstract

We consider the problem of maximizing the number of jobs completed by their deadline in an online single processor system where the jobs are preemptable and have release times. So in the standard three field scheduling notation, this is the online version of the problem 1 | r i;pmtn| ∑(1−U i). We give a constant competitive randomized algorithm for this problem. It is known that no constant competitive deterministic algorithm exists for this problem. This is the first time that this phenomenon, the randomized competitive ratio is constant in spite of the fact that the deterministic competitive ratio is nonconstant, has been demonstrated to occur in a natural online problem. This result is also a first step toward determining how an online scheduler can use additional processors in a real-time setting to achieve competitiveness.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Baruah, J. Harita, and N. Sharma, “On-line scheduling to maximize task completions”, IEEE Real-time Systems Symposium, 1994.

    Google Scholar 

  2. S. Baruah, G. Koren, D. Mao, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha, and F. Wang, “On the competitiveness of on-line real-time task scheduling”, Journal of Real-Time Systems, 4, 124–144, 1992.

    Article  Google Scholar 

  3. P. Brucker, Scheduling Algorithms, Springer-Verlag, 1995.

    Google Scholar 

  4. K. Christian, “Analyzing Real-Time Online Scheduling Algorithms with Respect to Completion Count”, manuscript.

    Google Scholar 

  5. S. Irani, and A. Karlin, “Online computation”, Chapter 13 of Approximation Algorithms for NP-hard Problems, ed. D. Hochbaum, PWS Publishing, 1997.

    Google Scholar 

  6. B. Kalyanasundaram and K. Pruhs “Speed is as powerful as clairvoyance”, IEEE Foundations of Computer Science, 214–223, 1995.

    Google Scholar 

  7. G. Koren and D. Shasha, “MOCA: A multiprocessor on-line competitive algorithm for real-time systems scheduling”, Theoretical Computer Science, 128, 75–97, 1994.

    Article  MATH  Google Scholar 

  8. C. Phillips, C. Stein, E. Torng, and J. Wein, “Optimal time-critical scheduling via resource augmentation”, ACM Symposium on Theory of Computation, 140–149, 1997.

    Google Scholar 

  9. Jiri Sgall, “On-line scheduling — a survey”, http://www.math.cas.cz/~sgall/ps/schsurv.ps.gz, To appear in the proceedings of the Dagstuhl workshop on On-Line Algorithms, eds. A. Fiat and G. Woeginger, Lecture Notes in Computer Science, Springer-Verlag.

    Google Scholar 

  10. G. Woeginger, “On-line scheduling of jobs with fixed start and end time”, Theoretical Computer Science, 130, 5–16, 1994.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of Pittsburgh, Pittsburgh, PA, 15260, USA

    Bala Kalyanasundaram & Kirk Pruhs

Authors
  1. Bala Kalyanasundaram
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kirk Pruhs
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Elettronica e Informatica, Università di Padova, via Gradenigo 6/A, I-35131, Padova, Italy

    Gianfranco Bilardi  & Geppino Pucci  & 

  2. Department of Electrical Engineering and Computer Science, The University of Illinois at Chicago, 851 South Morgan Street - 1009 SEO, Chicago, IL, 60607-7053, USA

    Gianfranco Bilardi

  3. Dipartimento di Matematica Applicata e Informatica, Università “Cá Foscari” di Venezia, via Torino 155, I-30173, Venezia Mestre, Italy

    Giuseppe F. Italiano

  4. Dipartimento di Matematica Pura e Applicata, Università di Padova, via Belzoni 7, I-35131, Padova, Italy

    Andrea Pietracaprina

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kalyanasundaram, B., Pruhs, K. (1998). Maximizing Job Completions Online. In: Bilardi, G., Italiano, G.F., Pietracaprina, A., Pucci, G. (eds) Algorithms — ESA’ 98. ESA 1998. Lecture Notes in Computer Science, vol 1461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68530-8_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-68530-8_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64848-2

  • Online ISBN: 978-3-540-68530-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation