The Community for Technology Leaders
Green Image
Issue No. 11 - Nov. (1986 vol. 12)
ISSN: 0098-5589
pp: 1089-1095
Arthur L. Liestman , School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada V5A 1S6
Roy H. Campbell , Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL 61801
A real-time system must be reliable if a failure to meet its timing specifications might endanger human life, damage equipment, or waste expensive resources. Applications that require remote operation, timing accuracy, and long periods of activity need mechanisms to support reliability. Fault tolerance improves reliability by incorporating redundancy into the system design. A deadline mechanism has been proposed to provide fault tolerance in real-time software systems. The mechanism trades the accuracy of the results of a service for timing precision. Two independent algorithms are provided for each service subject to a deadline. The primary algorithm produces a good quality service, although its real-time reliability may not be assured. The alternate algorithm is reliable and produces an acceptable response. This paper introduces an algorithm to generate an optimal schedule for the deadline mechanism and discusses a simple and efficient implementation. The schedule ensures the timely completion of the alternate algorithm despite a failure to complete the primary algorithm within real time.
Schedules, Real-time systems, Heuristic algorithms, Timing, Vegetation, Protocols, Software algorithms, software reliability, Real-time systems, scheduling, software fault tolerance

A. L. Liestman and R. H. Campbell, "A fault-tolerant scheduling problem," in IEEE Transactions on Software Engineering, vol. 12, no. , pp. 1089-1095, 1986.
93 ms
(Ver 3.3 (11022016))