Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (23): 118-122.DOI: 10.3778/j.issn.1002-8331.2009.23.033

• 网络、通信、安全 • Previous Articles     Next Articles

Trust-driven job scheduling algorithm for computing grid

LI Ran1,YU Jiong 1,2,HOU Yong1
  

  1. 1.School of Information Science and Engineering,Xinjiang University,Urumqi 830046,China
    2.School of Computer Science and Technology,Beijing Institute of Technology,Beijing 100081,China
  • Received:2008-05-06 Revised:2008-10-06 Online:2009-08-11 Published:2009-08-11
  • Contact: LI Ran

信任驱动的网格调度算法

李 冉1,于 炯1,2,侯 勇1   

  1. 1.新疆大学 信息科学与工程学院,乌鲁木齐 830046
    2.北京理工大学 计算机学院,北京 100081
  • 通讯作者: 李 冉

Abstract: At present existing grid scheduling algorithms ignore the impact of matching between resources and tasks.Based on trust utilization functions and matching conception between resources and tasks,a trust-driven grid job scheduling problem is presented for computing grid.The utility of QoS between tasks and resources consideration are taken into in the scheduling to improve Trust-Relation and TD_Min-min scheduling algorithms.Simulation results demonstrate that the algorithm’s performance is better than TD Trust-Relation,TD_Min-min in the aspects of trust utility,effective resource utility,load balance.

摘要: 针对目前网格资源管理中任务与资源匹配问题的不足,基于信任效益函数与匹配概念,提出了信任驱动的网格调度匹配算法。在调度中同时还考虑了任务和资源效益值,对已经提出的两种信任驱动的网格调度算法进行改进。结果证明:该算法较传统基于的信任驱动调度算法而言,信任效益值,资源效益值,负载平衡和失效服务数等方面有较好的综合性能。

CLC Number: