Skip to main content
SpringerLink
Log in

Scheduling in Hard Real-Time Systems

  • Chapter
Handbook on Scheduling

Part of the book series: International Handbook on Information Systems ((INFOSYS))

  • 2191 Accesses

Abstract

In Chapters 4 and 5 we analyzed scheduling problems in which the task performance is subject to temporal restrictions such as release times or deadlines. The present chapter deals with a similar problem, but where the tasks are to be processed repeatedly, and each execution is restricted by release times and deadlines. The release times are regularly distributed over time with equal distances called the task period. Such tasks are called periodic. The deadline is usually assumed to coincide with the release time of the next period. In many applications such as real-time systems we find problems where sets of periodic tasks are to be processed on a single processor or on a distributed or parallel processor system.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.00
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. B. Andersson, S. Baruah, J. Johnsson, static-priority scheduling on multiprocessors, in: Proceedings of the 22 nd IEEE Real-Time Systems Symposium, London, UK, 2001, 193–202.

    Google Scholar 

  2. T. P. Baker, Multiprocessor EDF and deadline monotonic schedulability analysis, in: Proceedings of the 24 th IEEE Real-Time Systems Symposium, 2003, 120–129.

    Google Scholar 

  3. S. Baruah, J. Goossens, Rate monotonic scheduling on uniform multiprocesors, IEEE Trans. Comput. 52, 2003, 966–970.

    Article  Google Scholar 

  4. S.-T. Cheng, A. K. Agrawala, Scheduling periodic tasks with relative timing constraints, U. of Maryland, CS-TR-3392, 1994.

    Google Scholar 

  5. S.-T. Cheng, A. K. Agrawala, Allocation and scheduling of real-time periodic tasks with relative timinig constraints. U. of Maryland, CS-TR-3402, 1995.

    Google Scholar 

  6. S. Choi, A. K. Agrawala, Dynamic dispatching of cyclic real-time tasks with relative constraints, U. of Maryland, CS-TR-3370, 1997.

    Google Scholar 

  7. S. Choi, A. K. Agrawala, L. Shi, Designing dynamic temporal controls for critical systems, U. of Maryland, CS-TR-3804, 1997.

    Google Scholar 

  8. S. Choi, Dynamic Time-Based Scheduling for Hard Real-Time Systems. Ph.D. Thesis, University of Maryland, 1997.

    Google Scholar 

  9. M. L. Dertouzos, Control Robotics: The Procedural Control of Physical Processors Proc. IFIP Congress, 1974, 807–813.

    Google Scholar 

  10. R. Devillers and J. Goossens, Liu and Layland’s Schedulability Test Revisited, Inform. Process. Lett. 73, 2000, 157–161.

    Article  Google Scholar 

  11. S. K. Dhall and C. L. Liu, On a real-time scheduling problem, Oper. Res. 26, 1978, 127–140.

    Article  Google Scholar 

  12. R. Gerber, Guaranteeing end-to-end timing processes, Proc. IEEE Real-Time System, 1995, 192–203.

    Google Scholar 

  13. R. Gerber, S. Hong, M. Saksena, Guaranteeing real-time requirements with resource-based calibration of periodic processes’, IEEE Trans. Software Engineering, 21, 1995, 579–592.

    Article  Google Scholar 

  14. M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco, 1979.

    Google Scholar 

  15. R. Gerber, W. Pugh, M. Saksena, Parametric dispatching of hard real-time tasks, IEEE Trans. Comput. 44, 1995, 471–479.

    Article  Google Scholar 

  16. W. A. Halang, A. D. Stoyenko, Constructing Predictable Real-Time Systems. Kluwer Academic Publishers, Boston, 1991.

    Google Scholar 

  17. R. Koymans, R. Kuiper, E. Zijlstra, Paradigms for real-time systems, in: M. Joseph (ed.), Formal Techniques in Real-Time and Fault-Tolerant Systems, Lecture Notes in Computer Science 331, Springer, 1988.

    Google Scholar 

  18. J. M. Lopez, J. L. Diaz, D. F. Garcia, Minimum and maximum utilization bounds for multiprocessor RM scheduling, in: Proceedings of the Euromicro Conference on Real-Time Systems, Delft, Netherlands, 2001, 67–75.

    Chapter  Google Scholar 

  19. C. L. Liu, J. W, Layland, Scheduling algorithms for multiprogramming in a hard-real-time environment, J. ACM 20, 1973, 46–61.

    Article  Google Scholar 

  20. J. Lehoczky, L. Sha, and Y. Ding. The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior, in: Proc. of the IEEE Real-Time Systems Symposium, 1989, 166–171.

    Google Scholar 

  21. A. K. Mok, D. Chen, A multiframe model for real-time tasks. University of Texas at Austin, 1996.

    Google Scholar 

  22. A. K. Mok, D. Chen, A general model for real-time tasks. University of Texas at Austin, 1996.

    Google Scholar 

  23. D. I. Oh, T. P. Baker, Utilization for N-processor rate monotone scheduling with stable processor assignment. Real-Time Systems 15, 1989, 183–193.

    Article  Google Scholar 

  24. K. Ramamrithram, J. Stankovic, Dynamic task scheduling in distributed hard real-time systems, in Proc. 4 th IEEE International Conference on Distributed Computing Systems, 1984, 96–107.

    Google Scholar 

  25. K. Ramamrithram, J. Stankovic, S. Cheng, Evaluation of a flexible task scheduling algorithm for distributed hard real-time systems, IEEE Trans. Comput. 34, 1985, 1130–1143.

    Google Scholar 

  26. R. Rajkumar, L. Sha, J. P. Lehoczki, K. Ramamritham, An optimal priority inheritance policy for synchronization ion real-time systems, in: S. H. Son (ed.), Advances in Real-Time Systems, Englewood Cliffs, NJ, Prentice-Hall, 1994, 249–271.

    Google Scholar 

  27. L. Sha, T, Abdelzaher, K.E. Årzén, A. Cervin, Th, Baker, A. Burns, G. Butazzo, M. Caccamo, J. Lehoczky, A. Mok, Real time scheduling theory: A historical perspective, Real-Time Systems 28, 2004, 101–155.

    Article  Google Scholar 

  28. L. Sha, J. Goodenough, Real-time scheduling theory and Ada, IEEE Computer 23, 1990, 53–62.

    Google Scholar 

  29. P. Sorensen, V. Hamacher, A real-time system design methodology, INFOR 13, 1975, 1–18.

    Google Scholar 

  30. L. Sha, J. P. Lehoczki, R. Rajkumar, Task scheduling in distributed real-time systems, in: Proceedings of the IEEE Industrial Electronics Conference, 1987.

    Google Scholar 

  31. P. Sorensen, A Methodology for Real-Time System Development. PhD Thesis, University of Toronto, 1974.

    Google Scholar 

  32. J. A. Stankovic, K. Ramamritham, M. Spuri, G. Buttazzo, Deadline Scheduling for Real-Time Systems, Kluwer, Boston-Dortrecht-London, 1998.

    Google Scholar 

  33. T. Teixeira, Static priority interrupt scheduling, in Proc. 7 th Texas Conference on Computing Systems, 15, 1978, 5.13–5.18.

    Google Scholar 

  34. J. Wikander, B. Svensson (guest eds.), Special Issue on Real-Time Systems in Mechatronic Applications. Real-Time Systems 14, 1998, 217–218

    Google Scholar 

Download references

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(2007). Scheduling in Hard Real-Time Systems. In: Handbook on Scheduling. International Handbook on Information Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32220-7_7

Download citation

Publish with us

Policies and ethics

Search

Navigation