首页> 外文OA文献 >Energy-aware Fault-tolerant Scheduling for Hard Real-time Systems
【2h】

Energy-aware Fault-tolerant Scheduling for Hard Real-time Systems

机译:硬实时系统的能量感知容错调度

摘要

Over the past several decades, we have experienced tremendous growth of real-time systems in both scale and complexity. This progress is made possible largely due to advancements in semiconductor technology that have enabled the continuous scaling and massive integration of transistors on a single chip. In the meantime, however, the relentless transistor scaling and integration have dramatically increased the power consumption and degraded the system reliability substantially. Traditional real-time scheduling techniques with the sole emphasis on guaranteeing timing constraints have become insufficient.In this research, we studied the problem of how to develop advanced scheduling methods on hard real-time systems that are subject to multiple design constraints, in particular, timing, energy consumption, and reliability constraints. To this end, we first investigated the energy minimization problem with fault-tolerance requirements for dynamic-priority based hard real-time tasks on a single-core processor. Three scheduling algorithms have been developed to judiciously make tradeoffs between fault tolerance and energy reduction since both design objectives usually conflict with each other. We then shifted our research focus from single-core platforms to multi-core platforms as the latter are becoming mainstream. Specifically, we launched our research in fault-tolerant multi-core scheduling for fixed-priority tasks as fixed-priority scheduling is one of the most commonly used schemes in the industry today. For such systems, we developed several checkpointing-based partitioning strategies with the joint consideration of fault tolerance and energy minimization. At last, we exploited the implicit relations between real-time tasks in order to judiciously make partitioning decisions with the aim of improving system schedulability.According to the simulation results, our design strategies have been shown to be very promising for emerging systems and applications where timeliness, fault-tolerance, and energy reduction need to be simultaneously addressed.
机译:在过去的几十年中,我们在规模和复杂性方面都经历了实时系统的巨大增长。这一进步之所以成为可能,很大程度上归功于半导体技术的进步,这使得晶体管能够在单个芯片上进行连续缩放和大规模集成。然而,与此同时,无情的晶体管缩放和集成已大大增加了功耗,并大大降低了系统可靠性。传统的仅注重保证时序约束的实时调度技术已经不足。在这项研究中,我们研究了如何在受多个设计约束的硬实时系统上开发高级调度方法的问题,特别是,时间,能耗和可靠性约束。为此,我们首先研究了在单核处理器上基于动态优先级的硬实时任务的具有容错要求的能量最小化问题。由于两个设计目标通常会相互冲突,因此已经开发了三种调度算法来明智地在容错和节能之间进行权衡。然后,随着后者成为主流,我们将研究重点从单核平台转移到了多核平台。具体来说,由于固定优先级调度是当今行业中最常用的方案之一,因此我们针对固定优先级任务的容错多核调度启动了研究。对于此类系统,我们结合了容错能力和能量最小化,开发了几种基于检查点的分区策略。最后,我们利用实时任务之间的隐式关系来明智地做出分区决策,以提高系统的可调度性。根据仿真结果,我们的设计策略已被证明对于新兴系统和应用具有非常大的前景及时性,容错性和能耗降低需要同时解决。

著录项

  • 作者

    Han Qiushi;

  • 作者单位
  • 年度 2015
  • 总页数
  • 原文格式 PDF
  • 正文语种
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号