Scheduling Fault-Tolerant Distributed Hard Real-Time Tasks Independently of the Replication Strategies

Authors:
Pascal Chevochot;Isabelle Puaut
Affiliations:
-;-
Venue:
RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Year:
1999

Citing 0
Cited 9

Are COTS Suitable for Building Distributed Fault-Tolerant Hard Real-Time Systems?

IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Scalable Resource Allocation for Multi-Processor QoS Optimization

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Design Optimization of Time-and Cost-Constrained Fault-Tolerant Distributed Embedded Systems

Proceedings of the conference on Design, Automation and Test in Europe - Volume 2
Synthesis of fault-tolerant embedded systems

Proceedings of the conference on Design, automation and test in Europe
Design optimization of time-and cost-constrained fault-tolerant embedded systems with checkpointing and replication

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A self-checking hardware journal for a fault-tolerant processor architecture

International Journal of Reconfigurable Computing - Special issue on selected papers from the international workshop on reconfigurable communication-centric systems on chips (ReCoSoC' 2010)
Scheduling and Optimization of Fault-Tolerant Embedded Systems with Transparency/Performance Trade-Offs

ACM Transactions on Embedded Computing Systems (TECS)
Static probabilistic worst case execution time estimation for architectures with faulty instruction caches

Proceedings of the 21st International conference on Real-Time Networks and Systems
Epipe: A low-cost fault-tolerance technique considering WCET constraints

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 systems, the presence of replication must be dealt with in scheduling algorithms, and more particularly in the feasibility tests in charge of testing whether deadlines will be met or not. So far, existing solutions to integrate replicated tasks in scheduling algorithms were specific to a given replication strategy or to its implementation on a given architecture. This paper is devoted to the description of a framework for taking into account the replicated tasks in scheduling algorithms that is largely independent of the replication technique. We show on an example that the same scheduling algorithm can be used whatever replication strategy is selected, even if several replication strategies are simultaneously used.