Guaranteeing deadlines in MAFT
- 6 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The author discusses scheduling in the multicomputer architecture for fault-tolerance (MAFT), a distributed system designed to provide extremely reliable computation in real-time control systems. Scheduling in MAFT is based on a fault-tolerant variation of a priority-list schedule. The threading delay associated with agreement on task completions can cause schedules to experience Richards' anomalies, in which legitimate run-time behavior can cause tasks to miss deadlines. The author develops theory to stabilize the fault-tolerant priority list. She gives an algorithm that stabilizes a restricted class of task workloads and discusses extensions of her results to other workloads.Keywords
This publication has 6 references indexed in Scilit:
- The MAFT architecture for distributed fault toleranceIEEE Transactions on Computers, 1988
- Deterministic Processor SchedulingACM Computing Surveys, 1977
- A Preliminary Evaluation of the Critical Path Method for Scheduling Tasks on Multiprocessor SystemsIEEE Transactions on Computers, 1975
- A comparison of list schedules for parallel processing systemsCommunications of the ACM, 1974
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969
- Production and Stabilization of Real-Time Task SchedulesJournal of the ACM, 1967