【24h】

Energy-Aware Task Scheduling with Precedence and Deadline Constraints on MPSoCs

机译:在MPSoC上具有优先级和截止日期约束的节能任务调度

获取原文

摘要

Energy reduction is a major issue in designing embedded systems. We investigate the problem of minimizing the total processor energy consumption of a set of nonpreemptible tasks with precedence constraints and individual deadlines that are executed on an MPSoC (MultiProcessor System on Chip) without shared memory, and propose a unified approach under two power models, namely the dynamic power model and the total power model. Our approach employs a novel priority scheme for task assignment and uses NLP (NonLinear Programming) to assign an optimal execution speed to each task. We have implemented our approach and compared it with two state-of-the-art energy-aware task scheduling approaches, namely LL-ES-GREEDY and EES by using a set of synthetic and real-world benchmarks. Experimental results show that the maximum improvement, the average improvement and the minimum improvement of our approach over the LL-ES-GREEDY approach are 42.44%, 30.46% and 9.46%, respectively. The maximum improvement, the average improvement and the minimum improvement of our approach over the EES approach are 75.98%, 39.74% and 7.08%, respectively.
机译:节能是设计嵌入式系统的主要问题。我们研究了在没有共享内存的MPSoC(片上多处理器系统)上执行的,具有优先权约束和单独期限的一组不可抢先任务的总处理器能耗最小化的问题,并提出了两种功耗模型下的统一方法,即动态功率模型和总功率模型。我们的方法采用新颖的优先级方案来分配任务,并使用NLP(非线性编程)为每个任务分配最佳执行速度。我们已经实施了我们的方法,并将其与两种最新的能源感知任务调度方法(即LL-ES-GREEDY和EES)进行了比较,方法是使用一组综合的和实际的基准。实验结果表明,与LL-ES-GREEDY方法相比,我们的方法的最大改进,平均改进和最小改进分别为42.44%,30.46%和9.46%。与EES方法相比,我们的方法的最大改进,平均改进和最小改进分别为75.98%,39.74%和7.08%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号