Sciweavers

93 search results - page 9 / 19
» Fault-Tolerant Earliest-Deadline-First Scheduling Algorithm
Sort
View
ICPP
2002
IEEE
14 years 13 days 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
RTS
2010
134views more  RTS 2010»
13 years 5 months ago
Improved multiprocessor global schedulability analysis
A new technique was recently introduced by Bonifaci et al. for the analysis of real-time systems scheduled on multiprocessor platforms by the global Earliest Deadline First (EDF) ...
Sanjoy K. Baruah, Vincenzo Bonifaci, Alberto March...
DSN
2003
IEEE
14 years 24 days ago
An Algorithm for Automatically Obtaining Distributed and Fault-Tolerant Static Schedules
Our goal is to automatically obtain a distributed and fault-tolerant embedded system: distributed because the system must run on a distributed architecture; fault-tolerant because...
Alain Girault, Hamoudi Kalla, Mihaela Sighireanu, ...
IPPS
1999
IEEE
13 years 11 months ago
Evolution-Based Scheduling of Fault-Tolerant Programs on Multiple Processors
The paper introduces a family of scheduling problems called fault-tolerant programs scheduling FTPS. Since FTPS problems are, in general, computationally di cult, a challenge is to...
Piotr Jedrzejowicz, Ireneusz Czarnowski, Henryk Sz...
PRDC
2006
IEEE
14 years 1 months ago
Fault-Tolerant Rate-Monotonic Scheduling Algorithm in Uniprocessor Embedded Systems
The general approach to fault tolerance in uniprocessor systems is to use time redundancy in the schedule so that any task instance can be re-executed in presence of faults during...
Hakem Beitollahi, Geert Deconinck