Sciweavers

209 search results - page 1 / 42
» Fault-Tolerant Scheduling on a Hard Real-Time Multiprocessor...
Sort
View
IPPS
1997
IEEE
13 years 9 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...
RTAS
2007
IEEE
13 years 11 months ago
Real-Time Task Replication for Fault Tolerance in Identical Multiprocessor Systems
Multiprocessor platforms have been widely adopted in both embedded and server systems. In addition to the performance improvement, multiprocessor systems could have the flexibili...
Jian-Jia Chen, Chuan-Yue Yang, Tei-Wei Kuo, Shau-Y...
RTCSA
1999
IEEE
13 years 9 months ago
Scheduling Fault-Tolerant Distributed Hard Real-Time Tasks Independently of the Replication Strategies
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...
Pascal Chevochot, Isabelle Puaut
PRDC
2006
IEEE
13 years 11 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