By Topic

Task scheduling with load balancing using multiple ant colonies optimization 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)
Liang Bai ; Key Lab. of C4ISR Technol., Nat. Univ. of Defense Technol., Changsha, China ; Yan-Li Hu ; Song-Yang Lao ; Wei-Ming Zhang

Task scheduling with load balancing in grid computing aims to assign tasks to computing nodes and minimize the execution time of tasks as well as workload across all nodes. Despite of the intractability, the scheduling problem is of particular concern to both users and grid systems. In this paper, a multiple ant colonies optimization (MACO) approach is proposed for achieving task scheduling with load balancing. In the MACO approach, multiple ant colonies work together and exchange information to collectively find solutions with a two-fold objective of minimizing the execution time of tasks and the degree of imbalance of computing nodes. Experimental results show that our algorithm outperforms FCFS and ACS approaches.

Published in:

Natural Computation (ICNC), 2010 Sixth International Conference on  (Volume:5 )

Date of Conference:

10-12 Aug. 2010