Comparative Study of Task Scheduling Algorithms through Cloudsim

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.

[1]  A. Taleb-Bendiab,et al.  A Comparative Study into Distributed Load Balancing Algorithms for Cloud Computing , 2010, 2010 IEEE 24th International Conference on Advanced Information Networking and Applications Workshops.

[2]  M. Ajit,et al.  VM level load balancing in cloud environment , 2013, 2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT).

[3]  Nguyen Hong Son,et al.  Load balancing algorithm based on estimating finish time of services in cloud computing , 2016, 2016 18th International Conference on Advanced Communication Technology (ICACT).

[4]  Atul Mishra,et al.  A Comparative Study of Load Balancing Algorithms in Cloud Computing Environment , 2014, ArXiv.

[5]  Fang Liu,et al.  NIST Cloud Computing Reference Architecture , 2011, 2011 IEEE World Congress on Services.

[6]  Taskeen Zaidi,et al.  Virtual Machine Allocation Policy in Cloud Computing Environment using CloudSim , 2018 .

[7]  G. Malathy,et al.  Checkpoint-Based Fault Identification in Cloud Computing Tasks , 2012 .

[8]  Himansu Sekhar Behera,et al.  Comparative performance analysis of multi dynamic time quantum Round Robin(MDTQRR) algorithm with arrival time , 2011, ArXiv.

[9]  Rajkumar Buyya,et al.  CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms , 2011, Softw. Pract. Exp..

[10]  Rajkumar Buyya,et al.  Deadline Based Resource Provisioningand Scheduling Algorithm for Scientific Workflows on Clouds , 2014, IEEE Transactions on Cloud Computing.

[11]  Jin Tong,et al.  NIST Cloud Computing Reference Architecture , 2011, 2011 IEEE World Congress on Services.

[12]  Aarti Singh,et al.  Autonomous Agent Based Load Balancing Algorithm in Cloud Computing , 2015 .

[13]  Taskeen Zaidi Rampratap Modeling for Fault Tolerance in Cloud Computing Environment , 2016 .

[14]  Saloni Jain,et al.  Efficient Optimal Algorithm of Task Scheduling in Cloud Computing Environment , 2014, ArXiv.

[15]  Bhawna Mallick,et al.  Load balancing in cloud computing using dynamic load management algorithm , 2015, 2015 International Conference on Green Computing and Internet of Things (ICGCIoT).

[16]  Priyanka Sharma,et al.  Analysis and Performance Assessment of CPU Scheduling Algorithms in Cloud using CloudSim , 2013 .

[17]  Shahenda Sarhan,et al.  A novel hybrid of Shortest job first and round Robin with dynamic variable quantum time task scheduling technique , 2017, Journal of Cloud Computing.

[18]  Nabeel Zanoon,et al.  STASR A New Task Scheduling Algorithm For Cloud Environment , 2015, Netw. Protoc. Algorithms.