Enhancing real-time schedules to tolerate transient faults

Authors:
S. Ghosh;R. Melhem;D. Mosse
Affiliations:
-;-;-
Venue:
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Year:
1995

Citing 0
Cited 14

Fault-Tolerant Rate-Monotonic Scheduling

Real-Time Systems
Analysis of Checkpointing for Real-Time Systems

Real-Time Systems
A Fault-Tolerant Scheduling Algorithm for Real-Time Periodic Tasks with Possible Software Faults

IEEE Transactions on Computers
Tolerating Transient Faults in Statically Scheduled Safety-Critical Embedded Systems

SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Scheduling with timed automata

Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
Schedulable persistence system for teal-time applications in virtual machine

EMSOFT '06 Proceedings of the 6th ACM & IEEE International conference on Embedded software
FLARe: a Fault-tolerant Lightweight Adaptive Real-time middleware for distributed real-time and embedded systems

Proceedings of the 4th on Middleware doctoral symposium
Proactive algorithms for job shop scheduling with probabilistic durations

Journal of Artificial Intelligence Research
Algorithms for testing fault-tolerance of sequenced jobs

Journal of Scheduling
A multi variable optimization approach for the design of integrated dependable real-time embedded systems

EUC'07 Proceedings of the 2007 international conference on Embedded and ubiquitous computing
Robust non-preemptive hard real-time scheduling for clustered multicore platforms

Proceedings of the Conference on Design, Automation and Test in Europe
Scheduling for real-time mobile MapReduce systems

Proceedings of the 5th ACM international conference on Distributed event-based system
Real-Time scheduling

Embedded Systems Design
Scheduling fixed-priority hard real-time tasks in the presence of faults

LADC'05 Proceedings of the Second Latin-American conference on Dependable Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a scheme to guarantee that the execution of real-time tasks can tolerate transient and intermittent faults assuming any queue-based scheduling technique. The scheme is based on reserving sufficient slack: in a schedule such that a task can be re-executed before its deadline without compromising guarantees given to other tasks. Only enough slack is reserved in the schedule to guarantee fault tolerance if at most one fault occurs within a time interval. This results in increased schedulability and a very low percentage of deadline misses even if no restriction is placed on the fault separation. We provide two algorithms to solve the problem of adding fault tolerance to a queue of real-time tasks. The first is a dynamic programming optimal solution and the second is a greedy heuristic which closely approximates the optimal.