Scheduling in grid computing environment based on genetic algorithm

Abstract

Grid computing is a new computing-framework to meet the growing computational demands. Computational grids provide mechanisms for sharing and accessing large and heterogeneous collections of remote resources. However, how to schedule the subtasks in these heterogeneous resources is a critical problem. In this paper, a scheduling-algorithm based on genetic algorithm (GA) is addressed. The chromosome coding method and the operator of genetic algorithm are discussed in detail. The relationship between subtasks can be obtained through the DAG, and then the subtasks are ranked according to their depth-value, which can avoid the emergence of invalidate chromosomes. In the single resource, two principles are adopted to determine the sequence of the subtasks: one is the short-subtask prior; the other is parent-sub task prior.