By Topic

A task scheduling method of grid service using ant colony optimization

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

1 Author(s)
Jun Mao ; Coll. of Comput. Sci. & Technol., Henan Polytech. Univ., Jiaozuo, China

Efficient scheduling of tasks for an application is critical for achieving high performance in Open Grid Services Architecture. The task scheduling has been shown to be NP complete in general case and also in several restricted cases. The paper introduces a novel framework for task scheduling problem based on Ant colony optimization (ACO). The performance of the algorithm is demonstrated by a Matlab program for producing effective schedules for random task sets.

Published in:

Artificial Intelligence, Management Science and Electronic Commerce (AIMSEC), 2011 2nd International Conference on

Date of Conference:

8-10 Aug. 2011