Sciweavers

84 search results - page 1 / 17
» The Space of Rate Monotonic Schedulability
Sort
View
RTSS
2002
IEEE
13 years 9 months ago
The Space of Rate Monotonic Schedulability
Feasibility analysis of fixed priority systems has been widely studied in the real-time literature and several acceptance tests have been proposed to guarantee a set of periodic ...
Enrico Bini, Giorgio C. Buttazzo
RTAS
1995
IEEE
13 years 8 months ago
A feasibility decision algorithm for rate monotonic scheduling of periodic real-time tasks
The rate monotonic scheduling algorithm is a commonly used task scheduling algorithm for periodic realtime task systems. This paper discusses feasibility decision for a given real...
Yoshifumi Manabe, Shigemi Aoyagi
IPL
2010
80views more  IPL 2010»
13 years 3 months ago
Rate monotonic scheduling re-analysed
In this paper, we re-analyse the Rate Monotonic Scheduler. Traditionally, the schedulability condition was obtained from the greatest lower bound of utilisation factors over all t...
Qiwen Xu, Naijun Zhan
RTSS
1999
IEEE
13 years 9 months ago
Design and Implementation of Statistical Rate Monotonic Scheduling in KURT Linux
Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [LL73] for periodic tasks with highly variable execution times and...
Alia Atlas, Azer Bestavros
RTSS
1998
IEEE
13 years 9 months ago
Statistical Rate Monotonic Scheduling
Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [10] for periodic tasks with highly variable execution times and s...
Alia Atlas, Azer Bestavros