A Priority-Based Grid Scheduling Algorithm P-M-M and Its Modeling and Simulation with Colored Petri Net

Abstract

Grid task scheduling has been an important part of grid computing due to the heterogeneity, dynamic and autonomy of resource and the diversity of the task under grid computing environment. Therefore, the efficiency of task scheduling algorithm determines the efficiency of grid computing, the scheduling algorithm should be designed perfectly[1]. Using graphical math tools to complete formal description, correct testing, performance evaluation and testing of the algorithm and system is very important and necessary. In this paper, two classical grid scheduling algorithms (Min-Min and Max-Min algorithm) were analyzed, and the result is that the maximum completion time (makespan) is relatively long and the loads are obviously unbalanced in Min-Min algorithm, but Max-Min algorithm has a smaller makespan. Based on the above study, there is a need to improve the grid scheduling algorithm, making that the task scheduling algorithm has a smaller makespan and balanced load between the entire system machines. Therefore, this paper proposes a priority-based grid scheduling algorithm P-M-M. In order to solve the problem of load balancing between machines, the algorithm uses the group method by the average expected execution time; to make a smaller makespan of the algorithm, each group runs in accordance with the Max-Min algorithm.