By Topic

A Comparison of Four Popular Heuristics for Task Scheduling Problem in Computational Grid

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)
Meihong Wang ; Software Sch., Xiamen Univ., Xiamen, China ; Wenhua Zeng

The grid computational environment is very suit to meet the computational demands of large, diverse groups of tasks. And the task scheduling problem in it has been a research hotspot in recent years. Some heuristic methods have been used to optimize it and have got some good results. However, selecting the best one to use in a given environment remains a difficult problem, because comparisons are often clouded by different underlying assumptions in the original study of each algorithm. Some comparisons have been made to them, but some new algorithms are not included in the comparisons. So, in this paper, four popular researched algorithms recently are selected, implemented, and analyzed. The four heuristics are Genetic Algorithm, Ant Colony Optimization Algorithm, Particle Swarm Optimization Algorithm and Simulated Annealing Algorithm. The evaluations include the schedule creating time, the makespan and the mean response time. It shows that for the cases studied here, the PSO heuristic performs better in comparison to the other techniques.

Published in:

2010 6th International Conference on Wireless Communications Networking and Mobile Computing (WiCOM)

Date of Conference:

23-25 Sept. 2010