首页> 外文期刊>Journal of Parallel and Distributed Computing >Non-evolutionary algorithm for scheduling dependent tasks in distributed heterogeneous computing environments
【24h】

Non-evolutionary algorithm for scheduling dependent tasks in distributed heterogeneous computing environments

机译:在分布式异构计算环境中调度相关任务的非进化算法

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

摘要

The Problem of obtaining an optimal matching and scheduling of interdependent tasks in distributed heterogeneous computing (DHC) environments is well known to be an NP-hard problem. In a DHC system, task execution time is dependent on the machine to which it is assigned and task precedence constraints are represented by a directed acyclic graph. Recent research in evolutionary techniques has shown that genetic algorithms usually obtain more efficient schedules that other known algorithms.We propose a non-evolutionary random scheduling (RS) algorithm for efficient matching and scheduling of inter-dependent tasks in a DHC system. RS is a succession of randomized task orderings and a heuristic mapping from task order to schedule. Randomized task ordering is effectively a topological sort where the outcome may be any possible task order for which the task precedent constraints are maintained. A detailed comparison to existing evolutionary techniques (GA and PSGA) shows the proposed algorithm is less complex than evolutionary techniques, computes schedules in less time, requires less memory and fewer tuning parameters. Simulation results show that the average schedules produced by RS are approximately as efficient as PSGA schedules for all cases studied and clearly more efficient than PSGA for certain cases.The standard formulation for the scheduling problem addressed in this paper is Rm vertical bar prec vertical bar C-max., (c) 2005 Elsevier Inc. All rights reserved.
机译:在分布式异构计算(DHC)环境中获得相互依赖的任务的最佳匹配和调度的问题是众所周知的NP难题。在DHC系统中,任务执行时间取决于为其分配任务的机器,并且任务优先级约束由有向无环图表示。进化技术的最新研究表明,遗传算法通常可以获得比其他已知算法更有效的调度。我们提出了一种非进化随机调度(RS)算法,用于DHC系统中相互依赖任务的高效匹配和调度。 RS是一连串的随机任务排序和从任务顺序到调度的启发式映射。随机任务排序实际上是一种拓扑排序,其中结果可以是维护任务先决约束的任何可能的任务顺序。与现有进化技术(GA和PSGA)的详细比较表明,所提出的算法不如进化技术复杂,可在更少的时间内计算调度,需要更少的内存和更少的调整参数。仿真结果表明,RS生成的平均进度表在所有研究案例中的效率均与PSGA进度表相当,并且在某些情况下明显比PSGA效率更高。本文解决的调度问题的标准公式为Rm -max。(c)2005 Elsevier Inc.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号