98 search results - page 1 / 20 » An Improved Schedulability Test for Uniprocessor Periodic Ta... |
ECRTS
2003
IEEE
13 years 10 months ago
2003
IEEE
We present a sufficient linear-time schedulability test for preemptable, asynchronous, periodic task systems with arbitrary relative deadlines, scheduled on a uniprocessor by an ...
RTSS
2000
IEEE
13 years 9 months ago
2000
IEEE
We present a new sufficient condition for the schedulability of preemptable, periodic, hard-real-time task sets using the very simple static-priority weight-monotonic scheduling ...
DAGSTUHL
2008
13 years 6 months ago
2008
The research on real-time scheduling has mostly focused on the development of algorithms that allows to test whether the constraints imposed on the task execution (often expressed ...
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...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...