89 search results - page 2 / 18 » Fault-Tolerant Partitioning Scheduling Algorithms in Real-Ti... |
RTCSA
1999
IEEE
13 years 9 months ago
1999
IEEE
Replication is a well-know fault-tolerance technique, and several replication strategies exist (e.g. active, passive, and semi-active replication). To be used in hard real-time sy...
RTSS
1995
IEEE
13 years 8 months ago
1995
IEEE
We present a scheme to guarantee that the execution of real-time tasks can tolerate transient and intermittent faults assuming any queue- based scheduling technique. The scheme is...
CORR
2010
Springer
13 years 2 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...
CORR
2010
Springer
12 years 12 months ago
2010
Springer
Algorithms based on semi-partitioned scheduling have been proposed as a viable alternative between the two extreme ones based on global and partitioned scheduling. In particular, ...
RTSS
2006
IEEE
13 years 11 months ago
2006
IEEE
We present a real-time, Linux-based testbed called LITMUSRT , which we have developed for empirically evaluating multiprocessor real-time scheduling algorithms. We also present th...