互联网 qkzz.net
全刊杂志网:首页 > 女性 > 文章正文
刊社推荐

基于有向无环图网格独立任务调度算法


□ 乔 付 张国印 刘忠艳

  摘 要:提出了基于有向无环图多约束网格环境下独立任务的调度模型,为其建立多约束线性规划模型,通过求解模型节点的优先级,获得网格各计算节点最优任务调度数;然后基于多约束最优任务调度方案,提出多约束带宽优先启发式算法(MCOPBHATS)和多约束计算速度优先启发式算法(MCOPCHATS)。实验结果表明,在多约束异构的网格环境下实现大量独立任务调度时, MCOPBHATS和MCOPCHATS算法的性能优于基于多约束最优任务调度方案的Min-Min 算法。
  关键词:网格计算;任务调度;有向无环图;线性规划;启发式算法
  中图分类号:TP393文献标志码:A
  文章编号:1001-3695(2009)06-2187-03
  doi:10.3969/j.issn.1001-3695.2009.06.057
  
  Independent tasks scheduling algorithm ofgrid computing platforms on direct acyclic graph
  QIAO Fu1,2,ZHANG Guo-yin1,LIU Zhong-yan2
  (1.College of Computer Science & Technology, Harbin Engineering University, Harbin 150001, China; 2.College of Computer & Information Engineering, Heilongjiang Institute of Science & Technology, Harbin 150027, China)Abstract:This paper discussed the model of scheduling independent tasks on multi constraints based direct acyclic graph grid computing platforms.Presented Multi constraints linear programming model.Using the model,obtained priority of each computing node,then obtained the optimal number of tasks scheduled each computing node. With the multi constraints optimal scheduling scheme,proposed multi constraints optimization-based priority-bandwidth heuristic algorithm for task scheduling (MCOPBHATS) and multi constraints optimization-based priority-computation heuristic algorithm for task scheduling (MCOPCHATS).The experimental results show that the proposed algorithms for the scheduling problem obtain better performance than Min-Min algorithms based on the multi constraints optimal scheduling scheme. ......
很抱歉,暂无全文,若需要阅读全文或喜欢本刊物请联系《计算机应用研究》杂志社购买。
欢迎作者提供全文,请点击编辑
分享:
 

了解更多资讯,请关注“木兰百花园”
分享:
 
精彩图文


关键字
支持中国杂志产业发展,请购买、订阅纸质杂志,欢迎杂志社提供过刊、样刊及电子版。
关于我们 | 网站声明 | 刊社管理 | 网站地图 | 联系方式 | 中图分类法 | RSS 2.0订阅 | IP查询
全刊杂志赏析网 2017