Trust-driven resource scheduling algorithm
Xie Zan Fu · Microcomputer & its Applications · 2010
At present,existing grid scheduling algorithms ignore the impact of matching between resources and tasks.Based on trust utilization functions and minimum completion time between resources and tasks, the Trust Mintime Min-Min based on trust mechanism is proposed.Analysis of the traditional Min-Min algorithm,the load balance is taken into in the scheduling,the scheduling model of the traditional Min-Min algorithm is improved.Simulation results indicate that this algorithm not only effectively balance load, but also can improve the completion rate of tasks and the calculation efficiency and reliability.