Abstract
The schedulability analysis of Rate-Monotonic scheduling algorithm is still under active investigation by researchers. New dimensions have been explored accordingly ranging from faster schedulability tests to optimal design of real-time systems. Recently, researchers extended the schedulability problem to even a more generalized problem: Rate-Monotonic Optimal Design Problem (RM-ODP) in which the execution time is limited in interval rather than a sole point. The RM-ODP deals with adjusting the execution times of tasks such that (i) the system is RM schedulable, and (ii) certain system performance (e.g. processor utilization) is optimized. In this paper, we first evaluate existing relevant feasibility tests by categorizing them into two broader classes: inexact and exact conditions. As a second contribution, we comprehensively review the RM-ODP and summarize associated advantages and disadvantages. Some recommendations on the schedulability tests are provided in order to assist system designers in selecting the most appropriate technique for the optimal design of the system to be run under RM scheduling policies.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
N.C. Audsley, A. Burns, M. Richardson, K. Tindell, A.J. Wellings, Applying new scheduling theory to static priority pre-emptive scheduling. Softw. Eng. J. 8(5), 284–292 (1993)
S. Baruah, K. Pruhs, Open problems in real-time scheduling. J. Scheduling 13(6), 577–582 (2010)
E. Bini, G.C. Buttazzo, G.M. Buttazzo, Rate monotonic analysis: the hyperbolic bound. IEEE Trans. Comput. 52(7), 933–942 (2003)
D. Chen, A.K. Mok, T.W. Kuo, Utilization bound revisited. IEEE Trans. Comput. 52(3), 351–361 (2003)
A. Cimatti, A. Griggio, B.J. Schaafsma, R. Sebastiani, The mathsat5 smt solver, in Tools and Algorithms for the Construction and Analysis of Systems (2013), pp. 93–107
L. De Moura, N. Bjørner, Satisfiability modulo theories: introduction and applications. Commun. ACM 54(9), 69–77 (2011)
A. DÃaz-RamÃrez, P. MejÃa-Alvarez, L.E. Leyva-del Foyo, Comprehensive comparison of schedulability tests for uniprocessor rate-monotonic scheduling. J. Appl. Res. Technol. 11(3), 408–436 (2013)
B. Dutertre, Yices 2.2. Computer Aided Verification, Lecture Notes in Computer Science (2014), pp. 737–744
F. Eisenbrand, T. Rothvoß, Static-priority real-time scheduling: Response time computation is np-hard, in Proceedings of the Real-Time Systems Symposium (2008), pp. 397–406
C.C. Han, H.Y. Tyan, A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms, in Proceedings of the 18th Real-Time Systems Symposium (1997), pp. 36–45
S. Han, M. Park, M. Park, A sufficient condition for rate monotonic schedulability based on response time analysis, in Proceedings of the International Conference on Computer and Information Technology (2010), pp. 1751–1757
T.W. Kuo, A.K Mok, Load adjustment in adaptive real-time systems, in Proceedings of the 12th Real-Time Systems Symposium (1991), pp. 160–170
T.W. Kuo, Y.H. Liu, K.J. Lini, Efficient on-line schedulability tests for priority driven real-time systems, in Proceedings of the 6th Real-Time Technology and Applications Symposium (2000), pp. 4–13
C.G. Lee, L. Sha, A. Peddi, Enhanced utilization bounds for qos management. IEEE Trans. Comput. 53(2), 187–200 (2004)
J. Lehoczky, L. Sha, Y. Ding, The rate monotonic scheduling algorithm: exact characterization and average case behaviour, in Proceedings of the Real Time Systems Symposium (1989), pp. 166–171
C.L. Liu, J.W. Layland, Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20(1), 46–61 (1973)
J. Liu, Y. Wang, J. Xing, Study of optimization problems with logic or relationships and its application to real-time system design. J. Softw. 17(7), 1641–1649 (2006)
W.C. Lu, K.J. Lin, H.W. Wei, W.K. Shih, Rate monotonic schedulability tests using period-dependent conditions. Real-Time Syst. 37(2), 123–138 (2007)
W.C. Lu, K.J. Lin, H.W. Wei, W.K. Shih, Efficient exact test for rate-monotonic schedulability using large period-dependent initial values. IEEE Trans. Comput. 57(5), 648–659 (2008)
N. Min-Allah, S.U. Khan, N. Ghani, J. Li, L. Wang, P. Bouvry, A comparative study of rate monotonic schedulability tests. J. Supercomputing 59(3), 1419–1430 (2012)
N. Min-Allah, S.U. Khan, X. Wang, A.Y. Zomaya, Lowest priority first based feasibility analysis of real-time systems. J. Parallel Distributed Comput. 73(8), 1066–1075 (2013)
M. Park, H. Park, An efficient test method for rate monotonic schedulability. IEEE Trans. Comput. 63(5), 1309–1315 (2014)
Acknowledgements
This work is supported by the National Key Research and Development Program of China (No. 2017YFB1400700), the National Natural Science Foundation of China (No. 61906220) and the National Natural Science Foundation of China (No. 61702570). Meijiao Duan is the corresponding author.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Li, Y., Wang, X., Liu, T., Wang, Y., Zhu, J., Duan, M. (2021). A Review of the Schedulability Tests and Optimal Design for Rate-Monotonic Scheduling. In: Liu, S., Bohács, G., Shi, X., Shang, X., Huang, A. (eds) LISS 2020. Springer, Singapore. https://doi.org/10.1007/978-981-33-4359-7_11
Download citation
DOI: https://doi.org/10.1007/978-981-33-4359-7_11
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-33-4358-0
Online ISBN: 978-981-33-4359-7
eBook Packages: Business and ManagementBusiness and Management (R0)