By Topic

An Hybrid Evaluative Algorithm Applied to 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

4 Author(s)
Wanneng Shu ; Dept. of Comput. Sci., Huazhang Normal Univ., Wuhan ; Shijue Zheng ; Li Gao ; Xiong Wang

Since the task scheduling in grid computing faces a NP-hard problem, it leads very difficult to validate the methods of task scheduling. This paper combined with the advantages of two evaluative algorithms: genetic algorithm and simulated annealing, brings forward an hybrid evaluative algorithm and applied to solve task scheduling problem in grid computing. From the analysis and experiment result, it is concluded that this algorithm is superior to genetic algorithm and simulated annealing

Published in:

Communications, Circuits and Systems Proceedings, 2006 International Conference on  (Volume:3 )

Date of Conference:

25-28 June 2006