• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2013, Vol. 35 ›› Issue (3): 38-42.

• 论文 • 上一篇    下一篇

分布式计算中基于Astar的工作流调度改进算法研究

李坤1,蒋莉莉2   

  1. (1.中国石油大学计算机与通信工程学院,山东 青岛 266555;2.东营职业学院计算机系,山东 东营 257091)
  • 收稿日期:2012-04-28 修回日期:2012-06-11 出版日期:2013-03-25 发布日期:2013-03-25

Research of the Astarbased workflow scheduling
advanced algorithm for distributed computing

LI Kun1,JIANG Lili2   

  1. (1.School of Computer and Communication Engineering,China University of Petroleum,Qingdao 266555;2.Department of Computer Science,Dongying Vocational College,Dongying 257091,China)
  • Received:2012-04-28 Revised:2012-06-11 Online:2013-03-25 Published:2013-03-25

摘要:

异构分布式系统中,若考虑每个任务的中间数据传输时间和计算时间,工作流调度问题就变得很难解决。论文在研究基于Astar的数据感知算法的基础上,通过在计算节点上进行任务执行和数据部署的重叠操作来实现最优调度。模拟结果显示,在大多数情况下,改进后的算法在性能和时间效率上要优于现有算法,明显降低工作流程周转时间。此外,也通过扩展所提算法来解决流程联合调度问题。

关键词: 工作流调度, 大规模科学计算, 最优调度, 周转时间

Abstract:

The workflow scheduling problem in heterogeneous distributed systems is hard to solve due to both the intermediate data transfer time and the computation time for each task being considered.The paper has a study of the dataaware workflow scheduling algorithm based on Astar,to achieve optimal scheduling which is through the overlapping of task execution and data deployment on computing sites.The simulation results show that, in most cases,the improved algorithm is superior to the existing work in performance and efficiency,and significantly reduces the turnaround time.In addition,we also extend the algorithm to solve the process coscheduling problem.

Key words: workflow scheduling;largescale scientific computing;optimal scheduling;turnaround time