【24h】

A DAG-Based XCIGS Algorithm for Dependent Tasks in Grid Environments

机译:网格环境中基于DAG的XCIGS算法用于相关任务

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

摘要

Generating high quality schedules for scientific computation on a computational grid is a challenging problem. Many scheduling algorithms in grid computing are for independent tasks. However, communications commonly occur among tasks executed on different grid nodes. In this paper, an extended Communication-Inclusion Generational Scheduling (XCIGS) algorithm is proposed to schedule dependent tasks of an application with their DAG. During scheduling, those ineligible tasks are momentarily ignored, and a Buffer Set of Independent tasks (BSI) is conducted to leverage the utilization of grid resources. The predicted transferring time, the machine ready time and the expectation completion time of all predecessors are taken into consideration while an alternative auxiliary algorithm dynamically makes the schedule. Corresponding experimental results suggest that it betters resource utilization of grid experiments and improves execution performance.
机译:在计算网格上生成用于科学计算的高质量计划是一个具有挑战性的问题。网格计算中的许多调度算法都用于独立的任务。但是,通信通常发生在不同网格节点上执行的任务之间。在本文中,提出了一种扩展的通信包含生成调度(XCIGS)算法,以利用其DAG调度应用程序的依赖任务。在调度过程中,那些不合格的任务会被暂时忽略,并执行独立任务缓冲区集(BSI)以利用网格资源的利用率。考虑了所有前辈的预计传输时间,机器准备时间和预期完成时间,同时使用替代辅助算法动态地制定了计划。相应的实验结果表明,它可以更好地利用网格实验的资源并提高执行性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号