Author:
Lahande Prathamesh,Kaveri Parag
Abstract
Cloud has grown significantly and has become a popular serviceoriented paradigm offering users a variety of services. The end-user submits requests to the cloud in the form of tasks with the expectation that they will be executed at the best possible lowest time, cost and without any errors. On the other hand, the cloud executes these tasks on the Virtual Machines (VM) by using resource scheduling algorithms. The cloud performance is directly dependent on how the resources are managed and allocated for executing the tasks. The main aim of this research paper is to compare the behaviour of cloud resource scheduling algorithms: First Come First Serve (FCFS) and Shortest Job First (SJF) by processing high-sized tasks. This research paper is broadly divided into four phases: the first phase includes an experiment conducted by processing approximately 80 thousand tasks from the Alibaba task event dataset using the resource scheduling algorithms: FCFS and SJF on the cloud VMs under different circumstances; the second phase includes the experimental results; the third phase includes a empirical analysis of the behaviour of resource scheduling algorithms; the last phase includes the proposed need of Reinforcement Learning (RL) to improve cloud resource scheduling and its overall performance.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献