Tolerance to Multiple Transient Faults for Aperiodic Tasks in Hard Real-Time Systems
IEEE Transactions on Computers（2000）
摘要
Real-time systems are being increasingly used in several applications which are time-critical in nature. Fault tolerance is an essential requirement of such systems, due to the catastrophic consequences of not tolerating faults. In this paper, we study a scheme that guarantees the timely recovery from multiple faults within hard real-time constraints in uniprocessor systems. Assuming earliest-deadline-first scheduling (EDF) for aperiodic preemptive tasks, we develop a necessary and sufficient feasibility-check algorithm for fault-tolerant scheduling with complexity $O(n^2 \cdot k)$, where $n$ is the number of tasks to be scheduled and $k$ is the maximum number of faults to be tolerated.
更多查看译文
关键词
hard real-time constraint,aperiodic tasks,hard real-time systems,essential requirement,cdot k,catastrophic consequence,fault-tolerant scheduling,aperiodic preemptive task,earliest-deadline-first scheduling,maximum number,real-time system,fault tolerance,multiple transient faults,earliest deadline first,earliest deadline first scheduling,redundancy,scheduling,fault tolerant,complexity,computational complexity,satellites,application software,real time systems
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要