10 search results - page 1 / 2 » Reliable mode changes in real-time systems with fixed priori... |
DATE
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract—Many application domains require adaptive realtime embedded systems that can change their functionality over time. In such systems it is not only necessary to guarantee ...
CORR
2010
Springer
13 years 1 months ago
2010
Springer
In this paper we study the partitioning approach for multiprocessor real-time scheduling. This approach seems to be the easiest since, once the partitioning of the task set has be...
ECRTS
2006
IEEE
13 years 10 months ago
2006
IEEE
At early stages in the design of real-time embedded applications, the timing attributes of the computational activities are often incompletely specified or subject to changes. Lat...
RTAS
2006
IEEE
13 years 10 months ago
2006
IEEE
Prior research on schedulability bounds focused primarily on bounding utilization as a means to meet deadline constraints. Non-trivial bounds were found for a handful of schedulin...
RTAS
2008
IEEE
13 years 10 months ago
2008
IEEE
A hybrid scheduling algorithm is proposed, which integrates features of the Fixed Priority (FP) and Earliest Deadline First (EDF) scheduling policies. It is shown that this hybrid...