Abstract
The recurring real-time task model for hard-real-time task is studied from a feasibility-analysis perspective. This model generalizes earlier models such as the sporadic task model and the generalized multiframe task model. Algorithms are presented for the static-priority and dynamic-priority feasibility-analysis of systems of independent recurring real-time tasks in a preemptive uniprocessor environment.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Audsley, N. C., Burns, A., Richardson, M. F., and Wellings, A. J. 1991. Hard real-time scheduling: The deadling monotonic approach. In Proceedings 8th IEEE Workshop on Real-Time Operating Systems and Software. Atalanta.
Audsley, N. C., Tindell, K. W., and Burns, A. 1993. The end of the line for static cyclic scheduling? In Proceedings of the EuroMicro Conference on Real-Time Systems. Oulu, Finland: IEEE Computer Society Press, pp. 36-41.
Baruah, S. 1998a. Feasibility analysis of recurring branching tasks. In Proceedings of the Tenth Euromicro Workshop on Real-time Systems. Berlin, Germany, pp. 138-145.
Baruah, S. 1998b. A general model for recurring real-time tasks. In Proceedings of the Real-Time Systems Symposium. Madrid, Spain: IEEE Computer Society Press, pp. 114-122.
Baruah, S., Chen, D., Gorinsky, S., and Mok, A. 1999. Generalized multiframed tasks. Real-Time Systems: The International Journal of Time-Critical Computing 17(1): 5-22.
Baruah, S., Mok, A., and Rosier, L. 1990. The preemptive scheduling of sporadic, real-time tasks on one processor. In Proceedings of the 11th Real-Time Systems Symposium. Orlando, Florida: IEEE Computer Society Press, pp. 182-190.
Burns, A., and Wellings, A. 1997. Real-Time Systems and Programming Languages, 2nd edn. New York: Addison-Wesley.
Buttazzo, G. C. 1997. Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications. Assinippi Park Norwell, MA: Kluwer Academic Publishers.
Carre, B. 1979. Graphs and Networks. Oxford Applied Mathematics and Computing Science Series. Oxford: Oxford University Press.
Dertouzos, M. 1974. Control robotics: The procedural control of physical processsors. In Proceedings of the IFIP Congress, pp. 807-813.
Joseph, M., and Pandya, P. 1986. Finding response times in a real-time system. The Computer Journal 29(5): 390-395.
Leung, J., and Whitehead, J. 1982. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation 2: 237-250.
Liu, C., and Layland, J. 1973. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM 20(1): 46-61.
Mok, A. K. 1983. Fundamental design problems of distributed systems for the hard real-time environment. Ph.D. Thesis, Laboratory for Computer Science, Massachusetts Institute of Technology. Available as Technical Report No. MIT/LCS/TR-297.
Mok, A. K., and Chen, D. 1996. A multiframe model for real-time tasks. In Proceedings of the 17th Real-Time Systems Symposium. Washington, DC: IEEE Computer Society Press.
Mok, A. K., and Chen, D. 1997. A multiframe model for real-time tasks. IEEE Transactions on Software Engineering 23(10): 635-645.
Takada, H., and Sakamura, K. 1997. Schedulability of generalized multiframe task sets under static priority assignment. In Proceedings of the Fourth International Workshop on Real-Time Computin Systems and Applications. Taipei, Taiwan, pp. 80-86.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Baruah, S.K. Dynamic- and Static-priority Scheduling of Recurring Real-time Tasks. Real-Time Systems 24, 93–128 (2003). https://doi.org/10.1023/A:1021711220939
Issue Date:
DOI: https://doi.org/10.1023/A:1021711220939