New grid job scheduling algorithm based on trust-driven
基于信任驱动的网格任务调度新算法*

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.