Abstract
Feasibility and schedulability problems have received considerable attention from the real-time systems research community in recent decades. Since the publication of the Liu and Layland bound, many researchers have tried to improve the schedulability bound of the RM scheduling. The LL bound does not make any assumption on the relationship between any of the task periods. In this paper we consider the relative period ratios in a system. By reducing the difference between the smallest and the second largest virtual period values in a system, we can show that the RM schedulability bound can be improved significantly. This research has also proposed a system design methodology to improve the schedulability of real time system with a fixed system load.
Similar content being viewed by others
References
Bini E, Buttazzo GC, Buttazzo GM (2003) Rate monotonic analysis: the hyperbolic bound. IEEE Trans Comput 52(7):933–942
Burchard A, Liebeherr J, Oh Y, Son SH (1995) Assigning real-time tasks to homogeneous multiprocessor systems. IEEE Trans Comput 44(12):1429–1442
Han CC, Tyan HY (1997) A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms. In: 18th IEEE real-time systems symposium, pp 36–45
Kuo TW, Chang LP, Liu YH, Lin KJ (2003) Efficient on-line schedulability tests for real-time systems. IEEE Trans Softw Eng 29(8):734–751
Lauzac S, Melhem R, Mossé D (2003) An improved rate-monotonic admission control and its applications. IEEE Trans Comput 52(3):337–350
Lehoczky J, Sha L, Ding Y (1989) The rate-monotonic scheduling algorithm: exact characterization and average behavior. In: Proceedings of the IEEE real-time systems symposium, pp 166–171
Liu JW-S (2000) Real-time systems. Prentice Hall, Englewood Cliffs
Liu CL, Layland JW (1973) Scheduling algorithms for multiprogramming in a hard real-time environment. J ACM 20(1):40–61
Liu J, Lee EA (2002) Timed multitasking for real-time embedded software. IEEE Control Syst Mag 23(1):65–75
Tan Y, Mooney V (2004) Timing analysis for preemptive multi-tasking real-time systems with caches. In: Proceedings of design, automation and test in Europe. Prentice Hall, Englewood Cliffs, pp 1034–1039
Author information
Authors and Affiliations
Corresponding author
Additional information
This paper is an extended version of the paper “Rate Monotonic Schedulability Conditions Using Relative Period Ratios” that appeared in the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications.
Rights and permissions
About this article
Cite this article
Lu, WC., Lin, KJ., Wei, HW. et al. Rate monotonic schedulability tests using period-dependent conditions. Real-Time Syst 37, 123–138 (2007). https://doi.org/10.1007/s11241-007-9034-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11241-007-9034-1