Selecting the most fitting resource for task execution ?
In the computing grid, task scheduling, in order to discover resources for users requirements, is important. In general, the task scheduler assigns tasks to a proper resource node for execution, and the resource nodes with better performance would be assigned first. When task loading is heavy and all resource nodes with better performance are assigned, other tasks have to be assigned to the resource nodes with inferior performance. Therefore, if a task is assigned to a resource node without considering the performance factor, the overall execution time will increase obviously. To solve this problem, a task scheduling algorithm that searches for the proper resource for task execution is proposed in this paper. Simulation results show that the proposed algorithm works well in dynamic environments.
computing grids task scheduling resource selection