Issue No.05 - May (1986 vol.35)
C.M. Krishna , Department of Electrical and Computer Engineering; University of Massachusetts
Multiprocessors used in life-critical real-time systems must recover quickly from failure. Part of this recovery consists of switching to a new task schedule that ensures that hard deadlines for critical tasks continue to be met. We present a dynamic programming algorithm that ensures that backup, or contingency, schedules can be efficiently embedded within the original, "primary" schedule to ensure that hard deadlines continue to be met in the face of up to a given maximum number of processor failures. Several illustrative examples are included.
notification times, Fault-tolerant and real-time multiprocessors, hard deadlines, primary and contingency schedules, primary and ghost clones
C.M. Krishna, K.G. Shin, "On Scheduling Tasks with a Quick Recovery from Failure", IEEE Transactions on Computers, vol.35, no. 5, pp. 448-455, May 1986, doi:10.1109/TC.1986.1676787