...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Design automation for embedded systems >Reward-based voltage scheduling for dynamic-priority hard real-time systems
【24h】

Reward-based voltage scheduling for dynamic-priority hard real-time systems

机译：动态优先级硬实时系​​统的基于奖励的电压调度

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Reward-based scheduling has been investigated for flexible applications in which an approximate but timely result is acceptable. Meanwhile, significant research efforts have been made on voltage scheduling which exploits the tradeoff between the processor speed and the energy consumption. In this paper, we address the combined scheduling problem of maximizing the total reward of hard real-time systems with a given energy budget. We present an optimal off-line algorithm and an efficient on-line algorithm for jobs with their own release-times/deadlines under Earliest-Deadline-First (EDF) scheduling. Experimental results show that the solution computed by the on-line algorithm is no more than 14% worse than the theoretical optimal solution obtained by the optimal off-line algorithm.
机译：已针对灵活的应用程序研究了基于奖励的计划，在这种应用程序中可以得出近似但及时的结果。同时，已经在电压调度方面进行了大量研究工作，该技术利用了处理器速度和能耗之间的折衷。在本文中，我们解决了在给定的能量预算下最大化硬实时系统总报酬的组合调度问题。我们针对在最早，最迟到第一（EDF）计划下具有自己的发布时间/最后期限的作业，提出了一种最佳的离线算法和一种有效的在线算法。实验结果表明，在线算法计算出的解比最优离线算法获得的理论最优解不超过14％。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号