By Topic

A new algorithm for grid independent task schedule: Genetic simulated annealing

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
$33 $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)
Jianqin Wang ; College of Information and Electrical Engineering, China Agricultural University, P.O.Box 142, Beijing, 10083, China. ; Qingling Duan ; Yuxin Jiang ; Xiuna Zhu

Task schedule is a critical issue of distributed computing. Foster et al. (2001) defined "Grid problem", which is defined as flexible, secure, coordinated resource sharing among dynamic collections of individuals, institutions, and resources -what they referred to as virtual organizations (VO). Improving the performance of grid computing relies much on the grid task scheduling algorithm. In this paper, a new genetic simulated annealing (GSA) algorithm which combines genetic algorithm (GA) with simulated annealing (SA) algorithm for grid task scheduling is proposed, it could avoid trapping in a local minimum effectively and get the global optimization at last. The algorithm performs better than genetic algorithm and simulated annealing algorithm respectively.

Published in:

World Automation Congress (WAC), 2010

Date of Conference:

19-23 Sept. 2010