Hybrid enhanced ant colony algorithm and enhanced bee colony algorithm for grid scheduling
by P. Mathiyalagan, S. Suriya, S.N. Sivanandam
International Journal of Grid and Utility Computing (IJGUC), Vol. 2, No. 1, 2011

Abstract: Selecting the right processor for a task is a complex problem in computational grids. The goal of resource allocation of tasks is the successful scheduling of tasks that reduces execution time. Usually, heuristic approaches are used for solving complex optimisation problems. In this paper, hybridisation of modified pheromone updating rule of ant colony algorithm and modified fitness functions of bee colony algorithm are proposed. The proposed method was simulated by using MATLAB with TORSCHE toolbox. The experimental results show that newly proposed hybrid modified ant colony method and modified bee colony method provide optimal solutions and reduce execution time of a particular task.

Online publication date: Sat, 28-Mar-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Grid and Utility Computing (IJGUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com