JIAO Yiming, ZHOU Chuan, GUO Jian, CUI Yuwei
With the development of computer technology and the continuous improvement of user needs,the problem of multiple Directed Acyclic Graph(DAG) sharing the same group of heterogeneous computing resources has attracted wide attention.However,due to the complexity and change of the actual tasks,there are certain differences between multiple DAG,which lead to the fairness problem of multiple DAG scheduling strategies.Therefore,this paper proposes an improved heuristic fair scheduling algorithm,IFairness.In selecting the DAG phase to be scheduled,a new evaluation index DAG completion degree is adopted,which replaces the remaining Makespan in the original Fairness algorithm as the DAG selection basis.In the calculation phase of the lag degree of each DAG,the principle of "looking forward one step" is adopted to solve the problem that some DAG cannot be scheduled at the initial stage.Simulation results show that compared with the original Fairness algorithm,the unfairness degree of the IFairness algorithm is reduced by 7.28%,and the resource utilization rate is improved by 11.97%,which effectively improves the fairness and resource utilization rate of the scheduling algorithm.