A new flower pollination based task scheduling algorithm in cloud environment

Abstract

Cloud Computing is in demand now a days as it provides reliable, scalable and economical IT operations. As the scale of the cloud computing is increasing the need of an efficient scheduling algorithm for an effecting management of resources is also becoming crucial. Scheduling problem in cloud is NP-hard problem. Meta-heuristic approaches have been very useful in providing near optimal solution to the scheduling problem. In this paper a new approach for Task Scheduling using Flower Pollination Algorithm (TSFPA) has been introduced to allocate resources to task. The objective of this proposed algorithm is to minimize the makespan. The performance of the proposed algorithm has been compared with genetic algorithm (GA), first come first serve (FCFS) and round robin (RR) approach of scheduling using Cloudsim toolkit. Simulation results showed that performance of TSFPA is better than GA, RR and FCFS in terms of makespan.