37 search results - page 1 / 8 » Rate monotonic scheduling re-analysed |
IPL
2010
13 years 5 months ago
2010
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...
RTAS
1995
IEEE
13 years 10 months ago
1995
IEEE
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...
PRDC
2006
IEEE
14 years 1 months ago
2006
IEEE
The general approach to fault tolerance in uniprocessor systems is to use time redundancy in the schedule so that any task instance can be re-executed in presence of faults during...
RTSS
2002
IEEE
13 years 12 months ago
2002
IEEE
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 ...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
Real-time systems using Rate Monotonic fixed priority scheduling can be checked for schedulability either by pessimistic schedulability conditions or exact testing. Exact testing ...