Research on Resource Scheduling Algorithm Based on Greedy Strategy
Zhongsheng Wang, Yonggui Han, Bozhi Xiao · 2022
With the advent of the era of big data and the popularity of smart phones, the impact of cloud computing on people’s daily life is increasing, and the improvement of living standards has also led to the rapid development of the level of science and technology. Cloud computing resource scheduling algorithm has always been the focus of cloud computing scientists. How to shorten the task completion time, improve the utilization of resources, reduce the energy consumption of the server and ensure the user QoS has been a hot topic in the field of cloud computing. This paper uses Java cloud computing simulation platform – CloudSim simulation platform. On the basis of CloudSim, create tasks with attributes such as instruction length, file size, and virtual resources including attributes such as memory, bandwidth and execution speed. In this experiment, the total execution time from transmission to completion on a single virtual resource is calculated according to the tasks and various attributes of virtual resources, and the total execution time is greedy, and the best allocation method with the least total execution time is selected. The time and the total execution time of the total transmission time and the shortest time are achieved. Under the condition of ensuring the user QoS, the load balancing is achieved.