Please use this identifier to cite or link to this item: https://idr.nitk.ac.in/jspui/handle/123456789/7298
Title: An hybrid bio-inspired task scheduling algorithm in cloud environment
Authors: Madivi, R.
Sowmya, Kamath S.
Issue Date: 2014
Citation: 5th International Conference on Computing Communication and Networking Technologies, ICCCNT 2014, 2014, Vol., , pp.-
Abstract: Cloud computing is currently a very popular computing paradigm as it provides ubiquitous, on-demand access as a service to computing resources via the Internet. In spite of offering marked advantages over the traditional style of computing, there are several issues related to load on the computing system and task scheduling to outperform the computation that need to be effectively solved in order to provide better quality of service to the service consumer. Task scheduling is a crucial research area since it affects the system load and performance; and there will always be scope for optimizing existing scheduling algorithms and propose efficient new task scheduling algorithms. Many task scheduling algorithms to resolve this problem have already been proposed - Particle Swarm Optimization, Ant Colony Optimization, Genetic algorithms, Artificial Bee Algorithm etc. In this paper, we propose a hybrid task scheduling algorithm that is based on combining the plus points of bio-inspired algorithms like Ant Colony Optimization and Artificial Bee Algorithm. We show were the strong points of both these algorithms can be utilized and incorporated in order to optimize task scheduling in the cloud algorithm. It is observed that the proposed algorithm gave an improvement of about 19% when compared to the default FCFS scheduling strategy, 11% better than ABC algorithm and performed 9% better than the conventional ACO based task scheduling. � 2014 IEEE.
URI: https://idr.nitk.ac.in/jspui/handle/123456789/7298
Appears in Collections:2. Conference Papers

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.