209 search results - page 3 / 42 » Fault-Tolerant Scheduling on a Hard Real-Time Multiprocessor... |
122
click to vote
ICPP
2002
IEEE
15 years 4 months ago
2002
IEEE
In this paper, we investigate an efficient off-line scheduling algorithm in which real-time tasks with precedence constraints are executed in a heterogeneous environment. It provi...
115
click to vote
CORR
2010
Springer
14 years 6 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, ...
101
Voted
RTCSA
2005
IEEE
15 years 5 months ago
2005
IEEE
We address in this paper the problem of scheduling for multiprocessor real-time systems with hard and soft tasks. Utility functions are associated to soft tasks to capture their r...
103
Voted
RTCSA
2008
IEEE
15 years 6 months ago
2008
IEEE
Real-time systems typically have to satisfy complex requirements, mapped to the task attributes, eventually guaranteed by the underlying scheduler. These systems consist of a mix ...
95
Voted
RTSS
1995
IEEE
15 years 3 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...