By Topic

Genetic algorithm for grid scheduling using best rank power

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)
Abdulal, W. ; CSE Dept., Osmania Univ., Hyderabad, India ; Al Jadaan, O. ; Jabas, A. ; Ramachandram, S.

The large computing capacity provided by grid systems is beneficial for solving complex problems by using many nodes of the grid at the same time. The usefulness of a grid system largely depends, among other factors, on the efficiency of the system regarding the allocation of jobs to grid resources. This paper proposes an Roulette Wheel Selection Genetic Algorithm using Best Rank Power(PRRWSGA) for scheduling independent tasks in the grid environment. The modified algorithm speeds up convergence and shortens the search time more than IRRWSGA, at the same time the heuristic initialization of initial population using MCT algorithm allow the algorithm to obtain a high quality feasible scheduling solution. The simulation results, show that PRRWSGA has better search time than both IRRWSGA and standard genetic algorithms. Real-world scheduling problems may utilize this algorithm for better results.

Published in:

Nature & Biologically Inspired Computing, 2009. NaBIC 2009. World Congress on

Date of Conference:

9-11 Dec. 2009