首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Quantum-Inspired Hyper-Heuristics for Energy-Aware Scheduling on Heterogeneous Computing Systems
【24h】

Quantum-Inspired Hyper-Heuristics for Energy-Aware Scheduling on Heterogeneous Computing Systems

机译:异构计算系统中基于能量的调度的量子启发式超启发式

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

摘要

Power and performance tradeoff optimization is one of the most significant issues on heterogeneous multiprocessor or multicomputer systems (HMCSs) with dynamically variable voltage. In this paper, the problem is defined as energy-constrained performance optimization and performance-constrained energy optimization. Task scheduling for precedence-constrained parallel applications represented by a directed acyclic graph (DAG) in HMCSs is an NP-HARD problem. Over the last three decades, several task scheduling techniques have been developed for energy-aware scheduling. However, it is impossible for a single task scheduling technique to outperform all other techniques for all types of applications and situations. Motivated by these observations, hyper-heuristic framework is introduced. Moreover, a quantum-inspired high-level learning strategy is proposed to improve the performance of this framework. Meanwhile, a fast solution evaluation technique is designed to reduce the computational burden for each iteration step. Experimental results show that the fast solution evaluation technique can improve average algorithm search speed by 38 percent and that the proposed algorithm generally exhibits outstanding convergence performance.
机译:功率和性能的折衷优化是动态可变电压的异构多处理器或多计算机系统(HMCS)上最重要的问题之一。在本文中,该问题被定义为能量受限的性能优化和性能受限的能量优化。由HMCS中的有向无环图(DAG)表示的优先级受限的并行应用程序的任务调度是NP-HARD问题。在过去的三十年中,已经开发了几种任务调度技术来进行能量感知调度。但是,对于所有类型的应用程序和情况,单个任务调度技术都无法胜过所有其他技术。基于这些观察,引入了超启发式框架。此外,提出了一种量子启发式的高级学习策略,以提高该框架的性能。同时,设计了一种快速解决方案评估技术,以减少每个迭代步骤的计算负担。实验结果表明,快速求解评估技术可以将平均算法的搜索速度提高38%,并且该算法通常表现出出色的收敛性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号