29 search results - page 1 / 6 » Computing the Minimum EDF Feasible Deadline in Periodic Syst... |
RTCSA
2006
IEEE
13 years 10 months ago
2006
IEEE
In most real-time applications, deadlines are artifices that need to be enforced to meet different performance requirements. For example, in periodic task sets, jitter requiremen...
ECRTS
2007
IEEE
13 years 8 months ago
2007
IEEE
It is well known that the performance of computer controlled systems is heavily affected by delays and jitter occurring in the control loops, which are mainly caused by the interf...
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 ...
OPODIS
2010
13 years 2 months ago
2010
The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an a...
RTSS
2003
IEEE
13 years 10 months ago
2003
IEEE
Schedulability tests are presented for preemptive earliest-deadline-first and deadline-monotonic scheduling of periodic or sporadic real-time tasks on a singlequeue Ñ-server sys...