By Topic

Improved genetic algorithm for scheduling divisible data grid application

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Abduh, M. ; Univ. Putra Malaysia, Serdang ; Othman, M. ; Ibrahim, H. ; Subramaniam, S.

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).

Published in:

Telecommunications and Malaysia International Conference on Communications, 2007. ICT-MICC 2007. IEEE International Conference on

Date of Conference:

14-17 May 2007