作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (17): 55-57. doi: 10.3969/j.issn.1000-3428.2009.17.018

• 软件技术与数据库 • 上一篇    下一篇

基于网格资源预测的任务优先级调度算法

刘洪伟1,于 炯1,2,田国忠1,3,龚红翠1   

  1. (1. 新疆大学信息科学与工程学院,乌鲁木齐 830046;2. 北京理工大学计算机学院,北京 100081; 3. 新疆工业高等专科学校计算机工程系,乌鲁木齐 830091)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-09-05 发布日期:2009-09-05

Task Priority Schedule Algorithm Based on Grid Resource Forecast

LIU Hong-wei1, YU Jiong1,2, TIAN Guo-zhong1,3, GONG Hong-cui1   

  1. (1. School of Information Science and Engineering, Xinjiang University, Urumqi 830046; 2. School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081; 3. Dept. of Computer Engineering, Xinjiang Polytechnic College, Urumqi 830091)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-09-05 Published:2009-09-05

摘要: 根据网格工作流中任务的依赖关系和截止时间,以及资源的有效度和MIPS(每秒百万条指令),提出基于网格资源预测的任务优先级调度算法。把网格任务工作流抽象为有向无环图,找到该工作流的关键路径,计算每个任务的最迟开始执行时间,作为任务的优先级。在算法中考虑用户的要求和资源的类型,以及任务调度失败后重新分配的问题。实验验证了该算法的有效性。

关键词: 工作流, 网格, 资源状态, 优先级

Abstract: According to the tasks’ dependence and deadline of grid workflow, effective degrees and MIPS of the grid resources, the task priority schedule algorithm based on grid resource forecast is presented. The algorithm uses DAG to find the critical path, obtains the deadline of every task and computes their PRI. The algorithm considers the request of user, the type of resources and re-schedule of failed tasks. Experimental result shows that the algorithm is effective.

Key words: workflow, grid, resource state, priority

中图分类号: