首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >A Hybrid Chemical Reaction Optimization Scheme for Task Scheduling on Heterogeneous Computing Systems
【24h】

A Hybrid Chemical Reaction Optimization Scheme for Task Scheduling on Heterogeneous Computing Systems

机译:异构计算系统任务调度的混合化学反应优化方案

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

摘要

Scheduling for (DAG) tasks with the objective of minimizing makespan has become an important problem in a variety of applications on heterogeneous computing platforms, which involves making decisions about the execution order of tasks and task-to-processor mapping. Recently, the (CRO) method has proved to be very effective in many fields. In this paper, an improved hybrid version of the CRO method called HCRO (hybrid CRO) is developed for solving the DAG-based task scheduling problem. In HCRO, the CRO method is integrated with the novel heuristic approaches, and a new selection strategy is proposed. More specifically, the following contributions are made in this paper. (1) A Gaussian random walk approach is proposed to search for optimal local candidate solutions. (2) A left or right rotating shift method based on the theory of maximum Hamming distance is used to guarantee that our HCRO algorithm can escape from local optima. (3) A novel selection strategy based on the normal distribution and a pseudo-random shuffle approach are developed to keep the molecular diversity. Moreover, an exclusive-OR (XOR) operator between two strings is introduced to reduce the chance of cloning before new molecules are generated. Both simulation and real-life experiments have been conducted in this paper to verify the effectiveness of HCRO. The results show that the HCRO algorithm schedules the DAG tasks much better than the existing algorithms in terms of makespan and speed of convergence.
机译:以最小化制造时间为目标的(DAG)任务调度已成为异构计算平台上各种应用程序中的一个重要问题,涉及制定任务的执行顺序和任务到处理器的映射。最近,事实证明(CRO)方法在许多领域都非常有效。在本文中,为解决基于DAG的任务调度问题,开发了一种称为HCRO(混合CRO)的CRO方法的改进混合版本。在HCRO中,将CRO方法与新颖的启发式方法相结合,并提出了一种新的选择策略。更具体地说,本文做出了以下贡献。 (1)提出了一种高斯随机游动方法来寻找最优的局部候选解。 (2)基于最大汉明距离理论的左或右旋转移位方法被用来保证我们的HCRO算法可以摆脱局部最优。 (3)提出了一种基于正态分布的新选择策略和伪随机改组方法来保持分子多样性。此外,引入了两个字符串之间的异或(XOR)运算符,以减少在生成新分子之前进行克隆的机会。本文已经进行了模拟和真实实验,以验证HCRO的有效性。结果表明,HCRO算法在时延和收敛速度方面比现有算法更好地调度了DAG任务。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号