Fault-Tolerant Energy Management for Real-Time Systems with Weakly Hard QoS Assurance
Fault-Tolerant Energy Management for Real-Time Systems with Weakly Hard QoS Assurance
复制标题
DOI：
10.1109/infocom42981.2021.9488822
复制
发表时间：
2021-05
期刊：
影响因子：
--
通讯作者：
Linwei Niu
中科院分区：
文献类型：
--
作者：
Linwei Niu
当能源消耗是实时嵌入式系统设计的主要关注点时，容错和服务质量（QoS）在当今普适计算系统的发展中变得越来越重要。在本工作中，我们研究了弱硬实时嵌入式系统的能量感知备用节省问题。备用备用系统采用一个主处理器和一个备用处理器来提供永久和短暂故障的容错能力。为了降低这类系统的能耗，我们提出了两种新的调度方案：一种是（1,1）硬任务，另一种是（m,k）一般硬任务，要求一个任务的任意k个连续作业中至少有m个符合其截止日期。通过广泛的评估，我们的结果表明，所提出的技术在降低(1,1)-硬任务集和一般(m,k)-硬任务集的能耗方面显著优于先前的研究，同时通过备用保护确保容错性。
While energy consumption is the primary concern for the design of real-time embedded systems, fault-tolerance and quality of service (QoS) are becoming increasingly important in the development of today’s pervasive computing systems. In this work, we study the problem of energy-aware standby-sparing for weakly hard real-time embedded systems. The standby-sparing systems adopt a primary processor and a spare processor to provide fault tolerance for both permanent and transient faults. In order to reduce energy consumption for such kind of systems, we proposed two novel scheduling schemes: one for (1,1)-hard tasks and one for general (m,k)-hard tasks which require that at least m out of any k consecutive jobs of a task meet their deadlines. Through extensive evaluations, our results demonstrate that the proposed techniques significantly outperform the previous research in reducing energy consumption for both (1,1)-hard task sets and general (m,k)-hard task sets while assuring fault tolerance through standby-sparing.