Probabilistic Scheduling Guarantees for Fault-Tolerant Real-Time Systems

Authors:
A. Burns;S. Punnekkat;L. Strigini;D. R. Wright
Affiliations:
-;-;-;-
Venue:
DCCA '99 Proceedings of the conference on Dependable Computing for Critical Applications
Year:
1999

Citing 0
Cited 9

Fault-Tolerant Adaptive Scheduling for Embedded Real-Time Systems

IEEE Micro
Reliability Modelling of Time-Critical Distributed Systems

FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Dynamic adaptation for fault tolerance and power management in embedded real-time systems

ACM Transactions on Embedded Computing Systems (TECS)
Exact Fault-Sensitive Feasibility Analysis of Real-Time Tasks

IEEE Transactions on Computers
Task mapping and priority assignment for soft real-time applications under deadline miss ratio constraints

ACM Transactions on Embedded Computing Systems (TECS)
Reliability analysis for MPSoCs with mixed-critical, hard real-time constraints

CODES+ISSS '11 Proceedings of the seventh IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Probablistic self-scheduling

Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Other issues

Embedded Systems Design
Stochastic response-time guarantee for non-preemptive, fixed-priority scheduling under errors

Proceedings of the 50th Annual Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hard real-time systems are usually required to provide an absolute guarantee that all tasks will always complete by their deadlines. In this paper we address fault tolerant hard real-time systems, and introduce the notion of a probabilistic guarantee. Schedulability analysis is used together with sensitivity analysis to establish the maximum fault frequency that a system can tolerate. The fault model is then used to derive a probability (likelihood) that, during the lifetime of the system, faults will not arrive faster than this maximum rate. The framework presented is a general one that can accommodate transient `software' faults, tolerated by recovery blocks or exception handling; or transient `hardware' faults dealt with by state restoration and re-execution.