DIFFERENT TASK SCHEDULING ALGORITHMS IN CLOUD COMPUTING

Abstract

Cloud Computing is a phenomenon in the current IT industry.It offers resources on a pay per user basis.Due to its benefits of high computing power, low service value, higher performance, accessibility in addition as availability makes it a power tool for users.Current work on task scheduling involves various algorithms like FCFS(First Come First Serve), Round-Robin, Priority Based Scheduling and SPF(Shortest Path First).The simulation has been done in Cloudsim.This work provides a comparative analysis of above algorithms on the basis of various quantitative metrics.From the analysis it has been observed that the Shortest Job First Algorithm is better among all these scheduling algorithms on the basis of minimum average waiting and turnaround time.