Sciweavers

DAGSTUHL
2008
13 years 6 months ago
Uniprocessor EDF Feasibility is an Integer Problem
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 ...
Enrico Bini
ECRTS
2007
IEEE
13 years 8 months ago
The Space of EDF Feasible Deadlines
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...
Enrico Bini, Giorgio C. Buttazzo
RTSS
2000
IEEE
13 years 9 months ago
Enhanced Fixed-Priority Scheduling with (m, k)-Firm Guarantee
In this paper, we study the problem of scheduling task sets with (m,k) constraints. In our approach, jobs of each task are partitioned into two sets: mandatory and optional. Manda...
Gang Quan, Xiaobo Sharon Hu
RTCSA
2006
IEEE
13 years 10 months ago
Computing the Minimum EDF Feasible Deadline in Periodic Systems
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...
Hoai Hoang, Giorgio C. Buttazzo, Magnus Jonsson, S...