By Topic

Job scheduling based on ant colony optimization in cloud 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

3 Author(s)
Xiangqian Song ; Sch. of Comput. & Control, Guilin Univ. of Electron. Technol., Guilin, China ; Lin Gao ; Jieping Wang

Effective job scheduling is critical in achieving on-demand resources allocation in dynamic cloud computing paradigm. In this paper, we proposed an Ant Colony Optimization based job scheduling algorithm, which adapts to dynamic characteristics of cloud computing and integrates specific advantages of Ant Colony Optimization in NP-hard problems. It aims to minimize job completion time based on pheromone. Experimental results obtained showed that it is a promising Ant Colony Optimization algorithm for job scheduling in cloud computing environment.

Published in:

Computer Science and Service System (CSSS), 2011 International Conference on

Date of Conference:

27-29 June 2011