首页> 外文会议>2012 International Green Computing Conference. >Simultaneous optimization of performance, energy and temperature for DAG scheduling in multi-core processors
【24h】

Simultaneous optimization of performance, energy and temperature for DAG scheduling in multi-core processors

机译:同时优化多核处理器中DAG调度的性能,能量和温度

获取原文
获取原文并翻译 | 示例

摘要

This paper addresses the joint optimization of performance, energy, and temperature, termed as PET - optimization. This multi-objective PET-optimization is achieved in scheduling DAGs on multi-core systems. Our technique is based on multi-objective evolutionary algorithm (MOEA) for finding Pareto optimal solutions using scheduling and voltage selection. These solutions are not necessarily scalar values but can be in a vector form. We developed a Strength Pareto Evolutionary Algorithm [2] (SPEA) based solution which is inherently superior to several other MOEA methods. The proposed algorithm obtains the Pareto vectors (or fronts) efficiently. The work is novel and original in the sense that no previous such optimization work has been reported to our knowledge for the PET-optimization scheduling problem. The strength of the proposed algorithm is that it achieves diverse range of energy and thermal improvements while staying close to the performance-optimal point to ensure efficient trade-off solutions. The proposed approach consists of two-steps. In the first step, Pareto fronts are generated. In the second step, one most optimal solution is selected. Simulation results on several benchmark task graph applications demonstrate that efficient solutions can be selected using the proposed selection method in polynomial time.
机译:本文介绍了性能,能量和温度的联合优化,称为PET-优化。通过在多核系统上调度DAG,可以实现这种多目标PET优化。我们的技术基于多目标进化算法(MOEA),可通过调度和电压选择找到帕累托最优解。这些解决方案不一定是标量值,而可以是矢量形式。我们开发了基于强度帕累托进化算法[2](SPEA)的解决方案,该解决方案本质上优于其他几种MOEA方法。所提出的算法有效地获得了帕累托向量(或前沿)。该工作是新颖的和新颖的,因为就PET优化计划问题而言,以前没有这样的优化工作据我们所知。所提出算法的优势在于,它在实现能源和热量改善的同时,还可以保持性能最佳点的多样性,以确保实现高效的折衷解决方案。所提出的方法包括两个步骤。第一步,生成帕累托前沿。在第二步中,选择一个最佳解决方案。在几个基准任务图应用程序上的仿真结果表明,可以使用所提出的选择方法在多项式时间内选择有效的解决方案。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号