期刊名称：International Journal of Engineering and Computer Science
印刷版ISSN：2319-7242
出版年度：2014
卷号：3
期号：7
页码：6943-6949
出版社：IJECS
摘要：Grid computing has emerged as an important field from the distributed and parallel computing where the resources of variouscomputers in the network are used to solve a particular problem, because of high demand of computational power and need of highperformance. To achieve the promising potential of grid computing, an effective and efficient job scheduling is required. Job scheduling isused to schedule the user jobs to appropriate resources in grid environment. Min-Min is the most simple and well known schedulingalgorithm in grid computing that is used to minimize the makespan. The drawback of min-min algorithm is that the schedule produced bymin-min is not optimal with respect of load balancing and it is not effective for resource utilization and one resource can execute one job at atime, the number of resources is known in prior. In this paper, a Min-Min Ant Colony (MMAC) algorithm is proposed that reduces themakespan and maximize the resource utilization using the features of both min-min algorithm and ant colony optimization. It is a two phasealgorithm.
关键词：Grid Computing; Job Scheduling; Min-Min algorithm; Ant Colony Optimization (ACO).
