Abstract
In the paper, we suggest new approach to schedulability problem for strict periodic tasks (a periodic task is strict if it must be started in equal intervals of time – task’s period). Given permissible tasks’ periods, our approach allows to obtain quickly all schedulable sets of tasks with such periods and to build immediately a conflict-free schedule for each obtained set. The approach is based on mathematical methods of graph theory and number theory. We illustrate the approach by a number of examples and present current practical results.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
Scheduling is called static, if the schedule is built before running the system.
- 2.
Task is called preemptive, if it may be interrupted by another task.
References
Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20, 46–61 (1973)
Yomsi, P.M., Sorel, Y.: Non-schedulability conditions for off-line scheduling of real-time systems subject to precedence and strict periodicity constraints. In: Proceedings of the 11th IEEE International Conference on Emerging Technologies and Factory Automation, ETFA 2006, Prague (2006)
Yomsi, P.M., 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: Proceedings of the 4th Multidisciplinary International Scheduling Conference, MISTA 2009, Dublin, Ireland (2009)
Zelenov, S.V.: Scheduling of strictly periodic tasks in real-time systems. Trudy ISP RAN. Proc. ISP RAS 20, 113–122 (2011). (in Russian)
Tretyakov, A.V.: Automation of scheduling for periodic real-time systems. Trudy ISP RAN. Proc. ISP RAS 22, 375–400 (2012). (in Russian)
Zelenova, S.A., Zelenov, S.V.: Non-conflict scheduling criterion for strict periodic tasks. Trudy ISP RAN. Proc. ISP RAS 29(6), 183–202 (2017). https://doi.org/10.15514/ISPRAS-2017-29(6)-10. (in Russian)
Zelenova, S.A., Zelenov, S.V.: Schedulability analysis for strictly periodic tasks in RTOS. Program. Comput. Softw. 44(3), 159–169 (2018). https://doi.org/10.1134/S0361768818030076
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Zelenova, S.A., Zelenov, S.V. (2019). Effective Scheduling of Strict Periodic Task Sets with Given Permissible Periods in RTOS. In: Bjørner, N., Virbitskaite, I., Voronkov, A. (eds) Perspectives of System Informatics. PSI 2019. Lecture Notes in Computer Science(), vol 11964. Springer, Cham. https://doi.org/10.1007/978-3-030-37487-7_18
Download citation
DOI: https://doi.org/10.1007/978-3-030-37487-7_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-37486-0
Online ISBN: 978-3-030-37487-7
eBook Packages: Computer ScienceComputer Science (R0)