Sciweavers

17 search results - page 1 / 4
» The Space of EDF Feasible Deadlines
Sort
View
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
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...
DAGSTUHL
2008
13 years 5 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
DATE
2008
IEEE
95views Hardware» more  DATE 2008»
13 years 10 months ago
Improvements in Polynomial-Time Feasibility Testing for EDF
This paper presents two fully polynomial-time sufficient feasibility tests for EDF when considering periodic tasks with arbitrary deadlines and preemptive scheduling on uniproces...
Alejandro Masrur, Sebastian Drossler, Georg Farber
ECRTS
2003
IEEE
13 years 9 months ago
Characteristics of EDF Schedulability on Uniform Multiprocessors
In uniform multiprocessor platforms, the various processors comprising the multiprocessor platform may have different computing capacities. The focus of this paper is the design o...
Shelby Funk, Sanjoy K. Baruah