Skip to Main Content
Optimizing job scheduling is the major issue in achieving high performance in grid computing systems. The grid workload consists of multiple jobs and the execution precedence constraints can be represented by a Directed Acyclic Graph. Genetic algorithms are useful to resolve large scale combinatorial prediction and optimization problems. In this paper, we represent a Coarse-grained parallel genetic algorithm based grid job scheduling model in which we minimize execution time of jobs and makespan of resources, improve utilization of resources. The analysis shows that the scheduling system using the coarse-grained parallel genetic algorithm can allocate job efficiently and effectively.
Date of Conference: 3-5 Dec. 2008