A New Heuristic Algorithm for Improving Total Completion Time in Grid Computing

Grid is a large scale distributed system, concerned with coordinated resource sharing and problem solving. To make effective use of the huge capabilities of the grids, efficient task scheduling heuristic for improving time are required. Total completion time is an important factor for assessment of algorithm in Grid. Many algorithms for decreasing of total completion time have been implemented so far. In this paper, we propose new scheduling heuristic based on well known task scheduling algorithms, Min-Min. The proposed heuristic tries to use the advantages of this basic algorithm and avoids its fails. To achieve this, the proposed heuristic presented a new strategy for choosing appropriate resource in any round. The simulation results by Gridsim show that the new heuristic can improve performance for a variety of assumptions.