Comparative Study of Task Scheduling Algorithms through Cloudsim

Abstract

Delivery of reliable services in cloud environment is a major issue. Reliability may be achieved by implementing the fault tolerance. Due to the abundant growth of traffic and service request on cloud datacenters, balancing the load in cloud environment is one of the serious challenges as failure may occur due to increase in power consumption, node failure, machine failure etc. Therefore there is a needof a policy for balancing the load among the datacenters and various solutions to balance the load have been proposed by researchers. Load distributionis the mechanism of dispersal the load between different nodes based on certain parameters such as underloaded(node) and overloaded (node). In this research articlewe have discussed the concept of dispersal of load and then perform a comparative analysis of various task-scheduling policies such as First Come First Serve, Shortest Job First and Round Robin onCloudsim.The simulation results on Cloudsim depicted that RR task-scheduling is much better than the FCFS and SJF whether we are using the Time shared policy or Space shared policy for execution of cloudlet.