2013 | OriginalPaper | Chapter
An Improved Min-Min Task Scheduling Algorithm in Grid Computing
Authors : Soheil Anousha, Mahmoud Ahmadi
Published in: Grid and Pervasive Computing
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Supercomputer prices on one hand and the need for vast computational resources on the other hand, led to the development of network computing resources were under name Grid. For optimal use of the capabilities of large distributed systems, the need for effective and efficient scheduling algorithms is necessary. For reduction of total completion time and improvement of load balancing, many algorithms have been implemented. In this paper, we propose new scheduling algorithm based on well known task scheduling algorithms, Min-Min. The proposed algorithm tries to use the advantages of this basic algorithm and avoids its drawbacks. To achieve this, the proposed algorithm firstly like Min-Min estimating of the completion time of the tasks on each of resources and then selects the appropriate resource for scheduling. The experimental results show that the proposed algorithm improved total completion time of scheduling in compared to Min-Min algorithm.