Sciweavers

89 search results - page 1 / 18
» Fault-Tolerant Partitioning Scheduling Algorithms in Real-Ti...
Sort
View
IPPS
1997
IEEE
13 years 8 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...
PRDC
2006
IEEE
13 years 10 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
RTAS
2007
IEEE
13 years 10 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...
ICPP
2002
IEEE
13 years 9 months ago
An Efficient Fault-Tolerant Scheduling Algorithm for Real-Time Tasks with Precedence Constraints in Heterogeneous Systems
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...
Xiao Qin, Hong Jiang, David R. Swanson