Abstract:

Task scheduling is the center of grid computing research. The aim of task scheduling is distributing tasks to achieve the optimal scheduling scheme and complete computing tasks effectively. In a grid environment how to use the resources effectively is one of the most important problems in task scheduling. The paper firstly introduces the design theory, advantages and disadvantages of the static task scheduling and dynamic task scheduling. The paper presents a new scheduling algorithm called SAMM considering the advantages of the most classical MinMin and MaxMin algorithms in grid computing. The SAMM schedules the corresponding algorithm to map the tasks and resources according to the use of the resources. Finally, the MinMin, MaxMin and SAMM algorithms are simulated with the aid of the GridSim simulation toolkit．The paper analyzes and compares the performances which affect the efficiency of task scheduling including MakeSpan and the resource load of the three task scheduling algorithms.

Key words: grid computing;task scheduling;MinMin;MaxMin