Abstract
Rate-monotonic algorithm is a classical algorithm for scheduling periodical tasks. Lots of work has been carried out to analyze the schedulability of RMS algorithm. While most of the work focus on the classical Liu and Layland task model. In this paper, we propose an approach to testing the schedulability of RMS algorithm on digraph task models. Our approach has higher efficiency since we just analyze schedulability of subtasks in the scheduling point set of one time interval rather than all possible cases.
This research is supported by Special Scientific Research Project No. 21JK0844 of Education Department of Shaanxi Province.
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
Similar content being viewed by others
References
Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM (JACM) 20(1), 46–61 (1973)
Mok, A.K.-L.: Fundamental design problems of distributed systems for the hard-real-time environment. Ph.D. thesis, Massachusetts Institute of Technology (1983)
Moyo, N.T., Nicollet, E., Lafaye, F., Moy, C.: On schedulability analysis of non-cyclic generalized multiframe tasks. In: 2010 22nd Euromicro Conference on Real-Time Systems, pp. 271–278. IEEE (2010)
Baruah, S., Chen, D., Gorinsky, S., Mok, A.: Generalized multiframe tasks. Real-Time Syst. 17(1), 5–22 (1999)
Stigge, M., Ekberg, P., Guan, N., Yi, W.: The digraph real-time task model. In: 2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium, pp. 71–80. IEEE (2011)
Baruah, S.: The non-cyclic recurring real-time task model. In: 2010 31st IEEE Real-Time Systems Symposium, pp. 173–182. IEEE (2010)
Baruah, S.K., Burns, A., Davis, R.I.: Response-time analysis for mixed criticality systems. In: 2011 IEEE 32nd Real-Time Systems Symposium, pp. 34–43. IEEE Computer Society (2011)
Nasri, M., Nelissen, G., Brandenburg, B.B.: Response-time analysis of limited-preemptive parallel DAG tasks under global scheduling. In: 31st Conference on Real-Time Systems, pp. 21–1 (2019)
Bini, E., Buttazzo, G.C.: Schedulability analysis of periodic fixed priority systems. IEEE Trans. Comput. 53(11), 1462–1473 (2004)
Anssi, S., Tucci-Piergiovanni, S., Kuntz, S., Gérard, S., Terrier, F.: Enabling scheduling analysis for AUTOSAR systems. In: 2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, pp. 152–159. IEEE (2011)
Cui, J., Duan, Z., Tian, C.: Model checking rate-monotonic scheduler with TMSVL. In: 2014 19th International Conference on Engineering of Complex Computer Systems, pp. 202–205. IEEE (2014)
Cui, J., Cong, T., et al.: Verifying schedulability of tasks in ROS-based systems. J. Comb. Optim. 37, 901–920 (2019)
Cui, J., Duan, Z., et al.: A novel approach to modeling and verifying real-time systems for high reliability. IEEE Trans. Reliab. 67(2), 481–493 (2018)
Lehoczky, J., Sha, L., Ding, Y.: The rate monotonic scheduling algorithm: exact characterization and average case behavior. In: RTSS, vol. 89, pp. 166–171 (1989)
Baruah, S.K.: Dynamic-and static-priority scheduling of recurring real-time tasks. Real-Time Syst. 24(1), 93–128 (2003)
Stigge, M., Yi, W.: Combinatorial abstraction refinement for feasibility analysis of static priorities. Real-Time Syst. 51(6), 639–674 (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Cui, J., Lu, X., Yu, G., Yu, B. (2023). Schedulability Analysis of Rate-Monotonic Algorithm on Concurrent Execution of Digraph Real-Time Tasks. In: Liu, S., Duan, Z., Liu, A. (eds) Structured Object-Oriented Formal Language and Method. SOFL+MSVL 2022. Lecture Notes in Computer Science, vol 13854. Springer, Cham. https://doi.org/10.1007/978-3-031-29476-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-031-29476-1_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-29475-4
Online ISBN: 978-3-031-29476-1
eBook Packages: Computer ScienceComputer Science (R0)