Cart (Loading....) | Create Account
Close category search window

An improved ant algorithm for job scheduling in grid computing

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)
Hui Yan ; Dept. of Comput., Zhejiang Univ. City Coll., Hangzhou, China ; Xue-Qin Shen ; Xing Li ; Ming-Hui Wu

In this paper, we propose an improved ant algorithm for job scheduling in grid computing. The new algorithm is based on the general ant adaptive scheduling heuristics and an added in load balancing guide component. The load balancing factor, related to the job finishing rate, is introduced to change the pheromone. That makes the job finishing rate at different resource being similar and the ability of the systematic load balancing improved. It has been successfully tested in a simulation grid environment. The experiments show that the new ant heuristic method can lead to significant performance in various applications.

Published in:

Machine Learning and Cybernetics, 2005. Proceedings of 2005 International Conference on  (Volume:5 )

Date of Conference:

18-21 Aug. 2005

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.