Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
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.
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.
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.
Buttazzo, G. C.: HARD REAL-TIME COMPUTING SYSTEMS: Predictable Scheduling Algorithms and Applications, Kluwer Academic Publishers, Boston, 1997.
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.
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.
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.
Dertouzos, M. L.: “Control Robotics: the Procedural Control of Physical Processes”, Information Processing 74, North-Holland Publishing Company, 1974.
Ghazalie, T. M. and T. P. Baker: “Aperiodic Servers In A Deadline Scheduling Environment”. The Journal of Real-Time Systems, 1995.
M. Joseph and P. Pandya, “Finding Response Times in a Real-Time System,” The Computer Journal, 29(5), pp. 390–395, 1986.
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.
Koren, G., and D. Shasha: “Skip-Over: Algorithms and Complexity for Overloaded Systems that Allow Skips”, IEEE Real-Time System Symposium, December 1995.
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.
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.
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.
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.
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.
Rajkumar, R.: Synchronous Programming of Reactive Systems, Kluwer Academic Publishing, 1991.
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.
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.
Spuri, M., and G. C. Buttazzo: “Efficient Aperiodic Service under Earliest Deadline Scheduling”, 15th IEEE Real-Time Systems Symposium, San Juan, Puerto Rico, 1994.
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.
Stankovic, J., and K. Ramamritham: Tutorial on Hard Real-Time Systems, IEEE Computer Society Press, 1988.
Stankovic, J.: “A Serious Problem for Next-Generation Systems”, IEEE Computer, pp. 10–19, October 1988.
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.
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. 1996
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buttazzo, G. (2002). Real-Time Operating Systems: Problems and Novel Solutions. In: Damm, W., Olderog, E.R. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT 2002. Lecture Notes in Computer Science, vol 2469. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45739-9_3
Download citation
DOI: https://doi.org/10.1007/3-540-45739-9_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44165-6
Online ISBN: 978-3-540-45739-8
eBook Packages: Springer Book Archive