Abstract
A new look at the problem of constructing a scheduler in the case of a group of strictly periodic tasks is proposed. The structure of the system of periods is represented in terms of graph theory. A criterion for the existence of a conflict-free schedule based on this representation is obtained, and generic schemes of algorithms for constructing such a schedule are described. The proposed approach is illustrated by building schedules for a number of strictly periodic tasks.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Liu, C.L. and Layland, J.W., Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment, J. ACM, 1973, No 20, p. 46–61.
Liu, J.W.S.W., Real-Time Systems, Upper Saddle River, NJ: Prentice Hall, 2000.
Zelenov, S.V., Scheduling of strictly periodic tasks in real-time systems, Trudy ISP RAN, 2011, vol. 20, pp. 113–122.
Tretyakov, A.V., Automation of scheduling for periodic real-time systems, Trudy ISP RAN, 2012, vol. 22, pp. 375–400.
Kermia, O. and Sorel, Y., Schedulability analysis for non-preemptive tasks under strict periodicity constraints, in Proc. of the 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, 2008, pp. 25–32
Marouf, M. and Sorel, Y., Schedulability conditions for non-preemptive hard real-time tasks with strict period, in Proc. of the 18th International Conference on Real-Time and Network Systems, RTNS’10, 2010, pp. 50–58
Yomsi, P.M. and Sorel, Y., Schedulability analysis for non necessarily harmonic real-time systems with precedence and strict periodicity constraints using the exact number of preemptions and no idle time, in Proc. of the 4th Multidisciplinary International Scheduling Conference, MISTA’09, Dublin, Ireland, 2009.
Yomsi, P.M. and Sorel, Y., Non-schedulability conditions for off-line scheduling of real-time systems subject to precedence and strict periodicity constraints, in Proc. of the 11th IEEE International Conference on Emerging Technologies and Factory Automation, ETFA’06, Prague, 2006.
Zelenova, S.A. and Zelenov, S.V., Non-conflict scheduling criterion for strict periodic tasks. Trudy ISP RAN, 2017, vol. 29, no. 6, pp. 183–202.
Zykov, A.A., Fundamentals of Graph Theory, BCS Associates, Idaho, 1990.
Christofides, N., Graph Theory: An Algorithmic Approach, London: Academic, 1975.
Ore, O., Theory of Graphs, Providence: American Mathematical Society, 1962.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © S.A. Zelenova, S.V. Zelenov, 2018, published in Programmirovanie, 2018, Vol. 44, No. 3.
Rights and permissions
About this article
Cite this article
Zelenova, S.A., Zelenov, S.V. Schedulability Analysis for Strictly Periodic Tasks in RTOS. Program Comput Soft 44, 159–169 (2018). https://doi.org/10.1134/S0361768818030076
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0361768818030076