84 search results - page 2 / 17 » The Space of Rate Monotonic Schedulability |
PRDC
2006
IEEE
13 years 11 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...
IPPS
2007
IEEE
13 years 12 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 ...
ISLPED
2007
ACM
13 years 7 months ago
2007
ACM
We address power minimization of earliest deadline first and ratemonotonic schedules by voltage and frequency scaling. We prove that the problems are NP-hard, and present (1+ ) f...
ESA
2009
Springer
14 years 4 days ago
2009
Springer
We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically...
RTAS
2005
IEEE
13 years 11 months ago
2005
IEEE
We consider the problem of energy minimization for periodic preemptive hard real-time tasks that are scheduled on an identical multiprocessor platform with dynamic voltage scaling...