摘要
针对目前网格资源管理中任务与资源匹配问题的不足,基于信任效益函数与匹配概念,提出了信任驱动的网格调度匹配算法。在调度中同时还考虑了任务和资源效益值,对已经提出的两种信任驱动的网格调度算法进行改进。结果证明:该算法较传统基于的信任驱动调度算法而言,信任效益值,资源效益值,负载平衡和失效服务数等方面有较好的综合性能。
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.
出处
《计算机工程与应用》
CSCD
北大核心
2009年第23期118-122,共5页
Computer Engineering and Applications
基金
国家自然科学基金No.60563002
教育部春晖计划项目(No.Z2005-1-65009)~~
关键词
网格计算
作业调度
服务质量
信任关系
信任效益函数
服务质量匹配度
grid computing
task schedule
Quality of Service(QoS)
trust relation
trust utility function
QoS matching degree