Abstract
This paper provides an overview of grid computing, grid scheduling and grid scheduling algorithms. In this paper various study and comparison of Min-Min algorithm and IACO algorithm has been described. The problem to make full use of all types of resources in the grid tasks scheduling has been discussed in this paper. Ant Colony Algorithm in grid computing is described. The paper discusses the problem to make full use of all types of resources in the grid tasks scheduling. When a large number of tasks request the grid resources, according to the task type of the adoption of appropriate strategies, the different tasks are assigned to the appropriate resources nodes to run it, in order to achieve the optimum utilization of resources. As the heterogeneous and dynamic of grid environment, while the different requirements for applications, making the tasks scheduling become extremely complex, the algorithm will have a direct impact on task execution efficiency of the grid environment, as well as the success or failure.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
