Deadline fault tolerance in a networked real-time system

Authors:
Peng Wen;Yan Li
Affiliations:
Faculty of Engineering and Surveying, The University of Southern Queensland, Toowoomba 4350, QLD, Australia, Email: pengwen@usq.edu.au;Department of Mathematics and Computing, The University of Southern Queensland, Toowoomba 4350, QLD, Australia, Email: liyan@usq.edu.au
Venue:
Proceedings of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006
Year:
2006

Citing 7
Cited 0

A fault-tolerant scheduling problem

IEEE Transactions on Software Engineering
Real-time personal computing: for data acquisition and control

Real-time personal computing: for data acquisition and control
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Real-Time Systems and Software

Real-Time Systems and Software
Computer Controlled Systems: Theory and Design

Computer Controlled Systems: Theory and Design
A Fault-Tolerant Scheduling Algorithm for Real-Time Periodic Tasks with Possible Software Faults

IEEE Transactions on Computers
Real-Time Systems: Scheduling, Analysis, and Verification

Real-Time Systems: Scheduling, Analysis, and Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper applies a well-developed algorithm in real-time computing to a networked real-time system, and model the system as a periodic real-time computing one. In this model, each process is named as a task and implemented in two versions: the primary and the alternate. The primaries might fail but the alternates are guaranteed. A scheduling algorithm manages to execute all primaries if possible. Otherwise it guarantees the executing of each task either the primary or the alternate before their deadlines. The algorithm is verified in simulation. The result shows that in cases with high failure probability, the low priority tasks have a lower completion rates. In cases with low failure probability, both high priority and low priority tasks can be completed very well.