By Topic

An Improved Shuffled Frog Leaping Algorithm for Grid Task Scheduling

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

2 Author(s)
Wu Yang ; Inf. & Educ. Technol. Center, Chongqing Univ. of Technol., Chongqing, China ; Yuanshu Sun

Grid computing has attracted many researchers' attention in the past few decades, and task scheduling is the key technology in Grid computing. The dynamic, heterogeneous and autonomous characteristics of grid make the scheduling approach a complex optimization problem. Many algorithms based on heuristic algorithm, genetic algorithm and particle swarm optimization algorithm have been presented to solve it, respectively. Unfortunately, their results have not been satisfied at all yet. In this paper, an improved shuffled frog leaping algorithm is proposed to solve the task scheduling in grid environment, and the simulation experiment results show that the new gird task scheduling algorithm is more robust and efficient than the existing algorithms.

Published in:

Network Computing and Information Security (NCIS), 2011 International Conference on  (Volume:1 )

Date of Conference:

14-15 May 2011