Real-Time Operating Systems: Problems and Novel Solutions

  • Giorgio Buttazzo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2469)


This work presents some methodologies for enhancing predictability in real-time computing systems, where explicit timing constraints have to be enforced on application processes. In order to provide an off-line guarantee of the critical timing constraints, deterministic and analyzable algorithms are required in all kernel mechanisms, especially involving scheduling, inter-task communication, synchronization and interrupt handling. This paper illustrates some problems that may arise in real-time concurrent applications and some solutions that can be adopted in the kernel to overcome those problems. In particular, task scheduling algorithms and resource management policies will be considered in detail, as they have great influence on system behavior. Finally, a novel approach will be introduced for handling transient overloads and execution overruns in soft real-time systems working in dynamic environments. These techniques provide efficient support to real-time multimedia systems.


Critical Section Early Deadline First Periodic Task High Priority Task Aperiodic Task 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Abeni, L., and G. Buttazzo: “Integrating Multimedia Applications in Hard Real-Time Systems”, Proceedings of the IEEE Real-Time Systems Symposium, Madrid, Spain, December 1998.Google Scholar
  2. 2.
    Audsley, N. C., A. Burns, M. Richardson, and A. Wellings: “Hard Real-Time Scheduling: The Deadline Monotonic Approach”, IEEE Workshop on Real-Time Operating Systems, 1992.Google Scholar
  3. 3.
    Baruah, S. K., R. R. Howell, and L. E. Rosier: “Algorithms and Complexity Concerning the Preemptive Scheduling of Periodic Real-Time Tasks on One Processor,” Real-Time Systems, 2, 1990.Google Scholar
  4. 4.
    Buttazzo, G. C.: HARD REAL-TIME COMPUTING SYSTEMS: Predictable Scheduling Algorithms and Applications, Kluwer Academic Publishers, Boston, 1997.zbMATHGoogle Scholar
  5. 5.
    Buttazzo, G. C. and F. Sensini: “Optimal Deadline Assignment for Scheduling Soft Aperiodic Tasks in Hard Real-Time Environments”, 3rd IEEE International Conference on Engineering of Complex Computer Systems (ICECCS), Como, Italy, September 1997.Google Scholar
  6. 6.
    Buttazzo, G. C., G. Lipari, and L. Abeni: “Elastic Task Model for Adaptive Rate Control”, Proceedings of the IEEE Real-Time Systems Symposium, Madrid, Spain, December 1998.Google Scholar
  7. 7.
    Buttazzo, G. C., and M. Caccamo: “Minimizing Aperiodic Response Times in a Firm Real-Time Environment”, IEEE Transactions on Software Engineering, Vol. 25, No. 1, pp. 22–32, January/February 1999.CrossRefGoogle Scholar
  8. 8.
    Dertouzos, M. L.: “Control Robotics: the Procedural Control of Physical Processes”, Information Processing 74, North-Holland Publishing Company, 1974.Google Scholar
  9. 9.
    Ghazalie, T. M. and T. P. Baker: “Aperiodic Servers In A Deadline Scheduling Environment”. The Journal of Real-Time Systems, 1995.Google Scholar
  10. 10.
    M. Joseph and P. Pandya, “Finding Response Times in a Real-Time System,” The Computer Journal, 29(5), pp. 390–395, 1986.CrossRefMathSciNetGoogle Scholar
  11. 11.
    Klein, M.H., et al.: A Practitioners’ Handbook for Real-Time Analysis: Guide to Rate Monotonic Analysis for Real-Time Systems. Boston, MA: Kluwer Academic Publishers, 1993.Google Scholar
  12. 12.
    Koren, G., and D. Shasha: “Skip-Over: Algorithms and Complexity for Overloaded Systems that Allow Skips”, IEEE Real-Time System Symposium, December 1995.Google Scholar
  13. 13.
    Lehoczky, J. P., L. Sha, and J. K. Strosnider: “Enhanced Aperiodic Responsiveness in Hard Real-Time Environments”, IEEE Real-Time Systems Symposium, pp. 261–270, San Jose, CA, December 1987.Google Scholar
  14. 14.
    Lehoczky, J. P., L. Sha, and Y. Ding: “The Rate-Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behaviour”, IEEE Real-Time Systems Symposium, pp. 166–171, 1989.Google Scholar
  15. 15.
    Lehoczky, J. P., and S. Ramos-Thuel: “An Optimal Algorithm for Scheduling Soft-Aperiodic Tasks in Fixed-Priority Preemptive Systems”, IEEE Real-Time Systems Symposium, 1992.Google Scholar
  16. 16.
    Leung, J., and J. Whitehead: “On the Complexity of Fixed Priority Scheduling of Periodic Real-Time Tasks”, Performance Evaluation, 2(4), pp. 237–250, 1982.CrossRefMathSciNetzbMATHGoogle Scholar
  17. 17.
    Liu, C. L., and J. W. Layland: “Scheduling Algoritms for Multiprogramming in a Hard-Real-Time Environment”, Journal of ACM, Vol. 20, No. 1, January 1973.Google Scholar
  18. 18.
    Rajkumar, R.: Synchronous Programming of Reactive Systems, Kluwer Academic Publishing, 1991.Google Scholar
  19. 19.
    Sha, L., R. Rajkumar, and J. P. Lehoczky: “Priority Inheritance Protocols: An Approach to Real-Time Synchronization”, IEEE Transactions on Computers, Vol. 39, No. 9, September 1990.Google Scholar
  20. 20.
    Sprunt, B., L. Sha, and J. Lehoczky: “Aperiodic Task Scheduling for Hard Real-Time System”, Journal of Real-Time Systems, 1, pp. 27–60, June 1989.Google Scholar
  21. 21.
    Spuri, M., and G. C. Buttazzo: “Efficient Aperiodic Service under Earliest Deadline Scheduling”, 15th IEEE Real-Time Systems Symposium, San Juan, Puerto Rico, 1994.Google Scholar
  22. 22.
    Spuri, M., and G. C. Buttazzo: “Scheduling Aperiodic Tasks in Dynamic Priority Systems”, Journal of Real-Time Systems, Vol. 10, No. 2, pp. 1–32, 1996.CrossRefGoogle Scholar
  23. 23.
    Stankovic, J., and K. Ramamritham: Tutorial on Hard Real-Time Systems, IEEE Computer Society Press, 1988.Google Scholar
  24. 24.
    Stankovic, J.: “A Serious Problem for Next-Generation Systems”, IEEE Computer, pp. 10–19, October 1988.Google Scholar
  25. 25.
    Stankovic, J., M. Spuri, M. Di Natale, G. Buttazzo: “Implications of Classical Scheduling Results for Real-Time Systems”, IEEE Computer, Vol. 28, No. 6, pp. 16–25, June 1995.Google Scholar
  26. 26.
    Stoica, I., H. Abdel-Wahab, K. Jeffay, S. Baruah, J.E. Gehrke, and G. C. Plaxton: “A Proportional Share Resource Allocation Algorithm for Real-Time Timeshared Systems”, IEEE Real-Time Systems Symposium, Dec. 1996Google Scholar
  27. 27.
    Strosnider, J. K., J. P. Lehoczky and L. Sha: “The Deferrable Server Algorithm for Enhanced Aperiodic Responsiveness in Hard Real-Time Environments”, IEEE Transactions on Computers, Vol. 44, No. 1, pp. 73–91, January 1995.zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Giorgio Buttazzo
    • 1
  1. 1.University of PaviaItaly

Personalised recommendations