Sciweavers

19 search results - page 1 / 4
» A probabilistic approach for fault tolerant multiprocessor r...
Sort
View
143
Voted
IPPS
1997
IEEE
15 years 3 months ago
Fault-Tolerant Deadline-Monotonic Algorithm for Scheduling Hard-Real-Time Tasks
This paper presents a new fault-tolerant scheduling algorithm for multiprocessor hard-real-time systems. The so called partitioning method is used to schedule a set of tasks in a ...
Alan A. Bertossi, Andrea Fusiello, Luigi V. Mancin...
123
Voted
PRDC
2006
IEEE
15 years 5 months ago
Fault-Tolerant Partitioning Scheduling Algorithms in Real-Time Multiprocessor Systems
This paper presents the performance analysis of several well-known partitioning scheduling algorithms in real-time and fault-tolerant multiprocessor systems. Both static and dynam...
Hakem Beitollahi, Geert Deconinck
59
Voted
IPPS
2007
IEEE
15 years 5 months ago
A Flexible Scheme for Scheduling Fault-Tolerant Real-Time Tasks on Multiprocessors
Michele Cirinei, Enrico Bini, Giuseppe Lipari, Alb...
68
Voted
IPPS
1994
IEEE
15 years 3 months ago
Fault-Tolerant Scheduling on a Hard Real-Time Multiprocessor System
Sunondo Ghosh, Rami G. Melhem, Daniel Mossé
81
Voted
IPPS
2006
IEEE
15 years 5 months ago
A probabilistic approach for fault tolerant multiprocessor real-time scheduling
In this paper we tackle the problem of scheduling a periodic real-time system on identical multiprocessor platforms, moreover the tasks considered may fail with a given probabilit...
Vandy Berten, Joël Goossens, Emmanuel Jeannot