Research Area:  Cloud Computing

Abstract:

Cloud computing refers to on-demand delivery of service over internet and has application in various domains like media, research, business, bigdata analysis etc. Task scheduling is one of the prime issues in this type of environment. Various metaheuristic algorithms and hard optimization problems have been proposed for solving cloud task scheduling which is a non-deterministic polynomial or an NP. Adaptation of the scheduling strategy to the changes taking place in the environment has to be done by a good scheduler. A proposal for cloud scheduling by means of a balanced load using both firefly algorithm (FA) and particle swarm optimization (PSO) heuristics has been made. The aim is to balance the load of the entire system while at the same time bring down the makespan of a set of tasks. This new strategy for scheduling has been simulated with CloudSim tool kit package. The results of this experiment proved that the proposed FA performed better than min–min scheduling, PSO, and also the first come first serve methods.

Keywords:  
Cloud computing
Scheduling
Load balancing algorithm
Firefly algorithm (FA)

Author(s) Name:   M. Aruna, D. Bhanu & S. Karthik

Publisher name:  Springer

DOI:  10.1007/s10586-017-1213-9

Volume Information:  volume 22, pages 10873–10881 (2019)

Paper Link:   https://link.springer.com/article/10.1007/s10586-017-1213-9