Rate monotonic schedulability tests using period-dependent conditions |
| |
Authors: | Wan-Chen Lu Kwei-Jay Lin Hsin-Wen Wei Wei-Kuan Shih |
| |
Affiliation: | (1) Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan;(2) Department of Electrical Engineering and Computer Science, University of California, Irvine, CA, USA |
| |
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.
|
| |
Keywords: | Real-time systems Periodic scheduling Rate monotonic analysis Schedulability test |
本文献已被 SpringerLink 等数据库收录! |