Rate monotonic schedulability tests using period-dependent conditions

Authors:
Wan-Chen Lu;Kwei-Jay Lin;Hsin-Wen Wei;Wei-Kuan Shih
Affiliations:
Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan;Department of Electrical Engineering and Computer Science, University of California, Irvine, USA;Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan;Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan
Venue:
Real-Time Systems
Year:
2007

Citing 7
Cited 1

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems

IEEE Transactions on Computers
An Improved Rate-Monotonic Admission Control and Its Applications

IEEE Transactions on Computers
A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms

RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Rate Monotonic Analysis: The Hyperbolic Bound

IEEE Transactions on Computers
Efficient Online Schedulability Tests for Real-Time Systems

IEEE Transactions on Software Engineering
Timing Analysis for Preemptive Multi-Tasking Real-Time Systems with Caches

Proceedings of the conference on Design, automation and test in Europe - Volume 2

Utilization bound for periodic task set with composite deadline

Computers and Electrical Engineering

Quantified Score

Hi-index	0.00

Visualization

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.