Skip to main content
SpringerLink
Log in

Online Real-Time Preemptive Scheduling of Jobs with Deadlines

  • Conference paper
  • First Online:
Approximation Algorithms for Combinatorial Optimization (APPROX 2000)

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

Abstract

In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized in terms of their minimum stretchf actor α (or, equivalently, their maximum execution rate r = 1/α). We consider two well known preemptive models that are of interest from practical applications: the hard real-time scheduling model in which a job must be completed if it was admitted for execution by the online scheduler, and the firm real-time scheduling model in which the scheduler is allowed not to complete a job even if it was admitted for execution by the online scheduler. In both models, the objective is to maximize the sum of execution times of the jobs that were executed to completion, preemption is allowed, and the online scheduler must immediately decide, whenever a job arrives, whether to admit it for execution or reject it. We measure the competitive ratio of any online algorithm as the ratio of the value of the objective function obtained by this algorithm to that of the best possible offline algorithm. We show that no online algorithm can have a competitive ratio greater than 1-(1/α)+ε for hard real-time scheduling with K ≥ 1 machines and greater than 1- (3/(4[α]) + ε for firm real-time scheduling on a single machine, where ε > 0 may be arbitrarily small, even if the algorithm is allowed to know the value of á in advance. On the other hand, we exhibit a simple online scheduler that achieves a competitive ratio of at least 1-(1/α) in either of these models with K machines. The performance guarantee of our simple scheduler shows that it is in fact an optimal scheduler for hard real-time scheduling with K machines. We also describe an alternative scheduler for firm real-time scheduling on a single machine in which the competitive ratio does not go to zero as α approaches 1. Both of our schedulers do not know the value of α in advance.

Research supported by NSF Grant CCR-9800086.

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. Baruah, S., G. Koren, B. Mishra, A. Ragunathan, L. Rosier, and D. Sasha, On-line Scheduling in the Presence of Overload,Proc. 32nd IEEE Symposium on Foundations of Computer Science, 100–110, October 1991.

    Google Scholar 

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

    Article  MATH  Google Scholar 

  3. Bar-Noy, A., R. Bar-Yehuda, A. Freund, J.(S.) Naor and B. Schieber, A Unified Approach to Approximating Resource Allocation and Scheduling, Proc. 32nd Annual ACM Symposium on Theory of Computing, 735–744, May 2000.

    Google Scholar 

  4. Bar-Noy, A., S. Guha, J. (S.) Naor and B. Schieber, Approximating the throughput of multiple machines in real-time scheduling, Proc. 31st Annual ACM Symposium on Theory of Computing, 622–631, 1999.

    Google Scholar 

  5. Berman P. and B. DasGupta, Improvements in Throughput Maximization for Real-Time Scheduling, Proc. 32nd Annual ACM Symposium on Theory of Computing, 680–687, May 2000.

    Google Scholar 

  6. Becchetti, L., S. Leonardi and S. Muthukrishnan, Scheduling to Minimize Average Stretch without Migration, Proc. 11thA nnual ACM-SIAM Symp. on Discrete Algorithms, 548–557, 2000.

    Google Scholar 

  7. Bender, M., S. Chakrabarti and S. Muthukrishnan, Flowan d Stretch Metrics for Scheduling Continuous Job Streams, Proc. 10thA nnual ACM-SIAM Symp. on Discrete Algorithms, 1999.

    Google Scholar 

  8. Brandt, S., G. Nutt, T. Berk, and M. Humphrey, Soft Real-Time Application Execution with Dynamic Quality of Service Assurance, 1998 International Workshop on Quality of Service, 154–163, May 1998.

    Google Scholar 

  9. Compton, C. and D. Tennenhouse, Collaborative Load Shedding, Proc. Workshop on the Role of Real-Time in Multimedia/Interactive Computing Systems, Dec. 1993

    Google Scholar 

  10. Dertouzos, M., Control Robotics: the Procedural Control of Physical Processors, Proc. IFIP Congress, 807–813, 1974.

    Google Scholar 

  11. Fan, C., Realizing a Soft Real-Tim Framework for Supporting Distributed Multimedia Applications, Proc. 5th IEEE Workshop on the Future Trends of Distributed Computing Systems, 128–134, August 1995.

    Google Scholar 

  12. Humphrey, M., T. Berk, S. Brandt, and G. Nutt, Dynamic Quality of Service Resource Management for Multimedia Applications on General Purpose Operating Systems, IEEE Workshop in Middleware for Distributed Real-Time Systems and Services, 97–104, Dec. 1997.

    Google Scholar 

  13. Jones, M., J. BarberaIII, and A. Forin, An Overviewo f the Rialto Real-Time Architecture, Proc. 7thA CM SIGOPS European Workshop, 249–256, Sept. 1996.

    Google Scholar 

  14. Jones, M., D. Rosu, and M.-C. Rosu, CPU Reservations and Time Constraints: Efficient, Predictable Scheduling of Independent Activities, Proc. 16thA CM Symposium on Operating Systems Principles, Oct. 1997.

    Google Scholar 

  15. Kise H., T. Ibaraki and H. Mine, A solvable case of one machine scheduling problems with ready and due dates, Operations Research 26, 121–126, 1978.

    Article  MATH  MathSciNet  Google Scholar 

  16. Koren G. and D. Shasha, An optimal on-line scheduling algorithm for overloaded real-time systems, SIAMJ. on Computing 24, 318–339, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  17. Lawler, E. L., A dynamic programming approach for preemptive scheduling of a single machine to minimize the number of late jobs], Annals of Operations Research 26, 125–133, 19

    Article  MATH  MathSciNet  Google Scholar 

  18. Lipton, R. J. and A. Tomkins, Online interval scheduling, Proc. 5thA nnual ACMSIAM Symp. on Discrete Algorithms, 302–311, 1994.

    Google Scholar 

  19. Liu, H. and M. E. Zarki, Adaptive source rate control for real-time wireless video transmission, Mobile Networks and Applications 3, 49–60, 1998.

    Article  Google Scholar 

  20. Mok, A., Fundamental Design Problems of Distributed Systems for the Hard Real-Time Environment, Doctoral Dissertation, M.I.T., 1983.

    Google Scholar 

  21. Muthukrishnan, S., R. Rajaraman, A. Shaheen abd J. E. Gehrke, Online Scheduling to Minimize Average Stretch, Proc. 40thAnn ual IEEE Symp. on Foundations of Computer Science, 433–443, 1999.

    Google Scholar 

  22. Nieh, J. and M. Lam, The Design, Implementation and Evaluation of SMART: A Scheduler for Multimedia Applications, Proc. 16thA CM Symposium on Operating Systems Principles, Oct. 1997.

    Google Scholar 

  23. Nieh, J. and M. Lam, Integrated Processor Scheduling for Multimedia, Proc. 5th International Workshop on Network and Operating System Support for Digital Audio and Video, April 1995.

    Google Scholar 

  24. Rajugopal, G. R. and R. H. M. Hafez, Adaptive rate controlled, robust video communication over packet wireless networks, Mobile Networks and Applications 3, 33–47, 1998.

    Article  Google Scholar 

  25. Sahni, S, Algorithms for scheduling independent tasks, JACM 23, 116–127, 1976.

    Article  MATH  MathSciNet  Google Scholar 

  26. Spieksma, F. C. R., On the approximability of an interval scheduling problem, Journal of Scheduling 2, 215–227, 1999 (preliminary version in the Proceedings of the APPROX’98 Conference, Lecture Notes in Computer Science, 1444, 169–180, 1998).

    Google Scholar 

  27. Yau, D. K. Y. and S. S. Lam, Adaptive rate-controlled scheduling for multimedia applications, Proc. IS&T/SPIEMultimedia Computing and Networking Conf., San Jose, CA, January 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Rutgers University, Camden, NJ, 08102, USA

    Bhaskar DasGupta & Michael A. Palis

Authors
  1. Bhaskar DasGupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael A. Palis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Christian-Albrechts-Universität zu Kiel Institut für Informatik und praktische Mathematik Olshausenstr, 40, 24098, Kiel, Germany

    Klaus Jansen

  2. Computer Science Department, University of Maryland, A.V. Williams Bldg College Park, MD 20742, USA

    Samir Khuller

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

DasGupta, B., Palis, M.A. (2000). Online Real-Time Preemptive Scheduling of Jobs with Deadlines. In: Jansen, K., Khuller, S. (eds) Approximation Algorithms for Combinatorial Optimization. APPROX 2000. Lecture Notes in Computer Science, vol 1913. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44436-X_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-44436-X_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67996-7

  • Online ISBN: 978-3-540-44436-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation