On Scheduling Tasks with a Quick Recovery from Failure
- 1 May 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-35 (5) , 448-455
- https://doi.org/10.1109/tc.1986.1676787
Abstract
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.Keywords
This publication has 2 references indexed in Scilit:
- A unified method for evaluating real-time computer controllers and its applicationIEEE Transactions on Automatic Control, 1985
- SIFT: Design and analysis of a fault-tolerant computer for aircraft controlProceedings of the IEEE, 1978