The research on meta-job scheduling heuristics in heterogeneous environments

Abstract

As the core of rational utilization of computing resources, the scheduling algorithm has gained the interest of many researchers. Aimed at meta-job scheduling in heterogeneous environments, this paper puts forward three algorithms: the meta-job scheduling algorithm based on deviation (MaxD-min heuristic), the meta-job scheduling algorithm based on relative deviation (MaxRD-min heuristic), and the Cordwood algorithm (CA). The former two Algorithm are improvements of the classic Min-min algorithm. The latter CA algorithm is a new method that tries to place each building block on the tray with minimal amount of Sufferage. The result of experimenting shows that the three algorithms, in comparison to Min-Min and Max-Min algorithm, can effectively reduce the total span of scheduling (makespan).