Skip to Main Content
Data grid technology promises geographically distributed scientists to access and share physically distributed resources such as computing resources, networks, storages, and most importantly data collections for large scale data intensive problems. In many data grid applications, data can be decomposed into multiple independent sub datasets and distributed for parallel execution and analysis. In this paper, we exploit this property and propose an Improved genetic algorithm (IGA) for scheduling divisible data grid applications. A good heuristic approach used to generate the initial population. Experimental results show that the proposed IGA gives better performance compared to the genetic algorithm (GA).