Transparent recovery from intermittent faults in time-triggered distributed systems

The time-triggered model, with tasks scheduled in static (off line) fashion, provides a high degree of timing predictability in safety-critical distributed systems. Such systems must also tolerate transient and intermittent failures which occur far more frequently than permanent ones. Software-based...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computers 2003-02, Vol.52 (2), p.113-125
Main Authors: Kandasamy, N., Hayes, J.P., Murray, B.T.
Format: Article
Language:English
Subjects:
Application software
Availability
Computer networks
Electromechanical systems
Embedded system
Embedded systems
Failure
Mathematical models
Microprocessors
Predictive models
Processor scheduling
Recovery
Redundancy
Runtime
Schedules
Studies
Tasks
Testing
Time measurements
Timing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The time-triggered model, with tasks scheduled in static (off line) fashion, provides a high degree of timing predictability in safety-critical distributed systems. Such systems must also tolerate transient and intermittent failures which occur far more frequently than permanent ones. Software-based recovery methods using temporal redundancy, such as task reexecution and primary/backup, while incurring performance overhead, are cost-effective methods of handling these failures. We present a constructive approach to integrating runtime recovery policies in a time-triggered distributed system. Furthermore, the method provides transparent failure recovery in that a processor recovering from task failures does not disrupt the operation of other processors. Given a general task graph with precedence and timing constraints and a specific fault model, the proposed method constructs the corresponding fault-tolerant (FT) schedule with sufficient slack to accommodate recovery. We introduce the cluster-based failure recovery concept which determines the best placement of slack within the FT schedule so as to minimize the resulting time overhead. Contingency schedules, also generated offline, revise this FT schedule to mask task failures on individual processors while preserving precedence and timing constraints. We present simulation results which show that, for small-scale embedded systems having task graphs of moderate complexity, the proposed approach generates FT schedules which incur about 30-40 percent performance overhead when compared to corresponding non-fault-tolerant ones.
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.2003.1176980