%0 Journal Article
%T New grid job scheduling algorithm based on trust-driven<br>基于信任驱动的网格任务调度新算法*
%A HUANG De-cai
%A ZHANG Li-jun
%A LU Yi-hong
%A GONG Wei-hua
%A <br>黄德才
%A 张丽君
%A 陆亿红
%A 龚卫华
%J 计算机应用研究
%D 2007
%I 
%X Applying the concept of trust and with the improvement on the traditional scheduling algorithm, dynamic algorithms TD_OLB, TD_MCT and static algorithm TD_max-min were presented based on trust-driven. At the meanwhile, the algorithms were compared with the traditional ones in the same condition and samples by simulation. The results illustrate that the schedu- ling algorithms based on trust-driven are better than the traditional ones based on makespan. Moreover, when the number Of the jobs with strong trusting relation is more than the total with weak trusting and without trusting relation, the performance of improved TD_max-min algorithm is better than the TD_min-min algorithm.
%K grid computing
%K grid security
%K trust model
%K trust-driven
%K job scheduling<br>网格计算
%K 网格安全
%K 信任模型
%K 信任驱动
%K 任务调度
%K 信任驱动
%K 网格任务调度
%K 静态调度算法
%K based
%K scheduling
%K algorithm
%K 信任关系
%K 关系任务
%K makespan
%K 仿真结果
%K 分析和比较研究
%K 设置
%K 条件
%K 动态
%K 改进
%K 信任机制
%K 利用
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=C793235A4E87B8F6B0EFC7FD27CABABF&yid=A732AF04DDA03BB3&vid=B91E8C6D6FE990DB&iid=708DD6B15D2464E8&sid=96C778EE049EE47D&eid=771469D9D58C34FF&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=11