A Fault-Tolerant Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems and Its Analysis
IEEE Transactions on Parallel and Distributed Systems
QoS Negotiation in Real-Time Systems and Its Application to Automated Flight Control
IEEE Transactions on Computers
Analysis of window-constrained execution time systems
Real-Time Systems
Optimal Control of Discrete Event Systems with Weakly Hard Real-Time Constraints
Discrete Event Dynamic Systems
Dynamic real-time channel establishment in multiple access bus networks
Computer Communications
Best-effort scheduling of (m,k)-firm real-time streams in multihop networks
Computer Communications
Hi-index | 0.00 |
Tasks in a real-time control application are usually periodic and they have deadline constraints by which each instance of a task is expected to complete its computation even in the adverse circumstances caused by component failures. Techniques to recover from processor failures often involve a reconfiguration in which all tasks are assigned to fault-free processors. This reconfiguration may result in processor overload where it is no longer possible to meet the deadlines of all tasks. In this paper, we discuss an overload management technique which discards selected task instances in such a way that the performance of the control loops in the system remain satisfactory even after a failure. The technique is based on the rationale that real-time control applications can tolerate occasional misses of the control law updates, especially if the control law is modified to account for these missed updates. The paper devises a scheduling policy which deterministic guarantees when and where the misses will occur and proposes a methodology for modifying the control law to minimize the deterioration in the control system behavior as a result of these missed control law updates.