Transient overloads in fault-tolerant real-time systems
- 7 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 126-133
- https://doi.org/10.1109/real.1989.63563
Abstract
A novel technique that allows a single system to guarantee the execution of both periodic and aperiodic tasks within hard deadlines is presented. The approach is based on dynamically changing the replication factor of periodic tasks in response to aperiodic tasks. The technique is directly applicable to the problem of transient overloads that are time-critical. Preliminary results that show the applicability and the tradeoffs involved are presented.Keywords
This publication has 12 references indexed in Scilit:
- Fault-tolerant real-time task scheduling in the MAFT distributed systemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The MAFT architecture for distributed fault toleranceIEEE Transactions on Computers, 1988
- Preemptive Scheduling Under Time and Resource ConstraintsIEEE Transactions on Computers, 1987
- Evaluation of a flexible task scheduling algorithm for distributed hard real-time systemsIEEE Transactions on Computers, 1985
- Synchronizing clocks in the presence of faultsJournal of the ACM, 1985
- Dynamic Task Scheduling in Hard Real-Time Distributed systemsIEEE Software, 1984
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982
- Elections in a Distributed Computing SystemIEEE Transactions on Computers, 1982
- An optimal algorithm for mutual exclusion in computer networksCommunications of the ACM, 1981
- The implementation of reliable distributed multiprocess systemsComputer Networks (1976), 1978