Trust-driven job scheduling algorithm for computing grid

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.