Analysis of scheduling algorithms in cloud computing
Loading...
Date
2017-08
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
G.B. Pant University of Agriculture and Technology, Pantnagar - 263145 (Uttarakhand)
Abstract
Cloud computing is a rapidly growing paradigm, which has gained tremendous interest in researchers at the industrial level and at the academic level. As a result, many researchers have been enthusiastically involved in research projects related to cloud computing. Researcher's major challenge in cloud computing is to provide a solution to the scheduling problem. We have analyzed various scheduling algorithms for user’s
performance criteria. We have proposed an enhanced conductance based scheduling algorithm, which has been implemented to bind the cloudlets on cloud resources minimizing the overall execution time and resource utilization and to increase system’s QoS. The purpose of our proposed research is to analyze the scheduling algorithm in cloud computing, keeping in view VM’s MIPS and length of tasks. Using the CloudSim simulation toolkit, we have evaluated the performance of existing algorithms like FCFS. We have analyzed scheduling algorithms for the time shared environment in cloudlet provisioning policies. The results of our simulation proved the efficiency of the new proposed approach in reducing the overall execution time and in the makespan. With our extensive study of cloudsim library we have analyzed these algorithms by extending the datacenter broker class of CloudSim.
Description
Keywords
null