Cloud Backup Scheduling Algorithm Based on Cloud State Table and Cloud Resources Table

Author(s):  
Liang Ge ◽  
Junduo Yang ◽  
Qingsheng Zhu ◽  
Qiang Chen ◽  
Kang Lv ◽  
...  
Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Jiaohui Yu

Aiming at the problem of resource scheduling optimization in enterprise management cloud mode, a customizable fuzzy clustering cloud resource scheduling algorithm based on trust sensitivity is proposed. Firstly, on the one hand, a fuzzy clustering method is used to divide cloud resource scheduling into two aspects: cloud user resource scheduling and cloud task resource scheduling. On the other hand, a trust-sensitive mechanism is introduced into cloud task scheduling to prevent malicious node attacks or dishonest recommendation from node providers. At the same time, in the cloud task scheduling, cloud resources are divided according to the comprehensive performance of resources, and the trust sensitivity coefficient of each type of task resources is calculated. Then, according to the trust sensitivity coefficient, the matching cloud tasks are selected for users. Through the comparison of simulation experiments, the customized fuzzy clustering cloud resource scheduling algorithm proposed in this paper reduces the user’s cost of selecting cloud service provider in the cloud resource scheduling. It not only embodies the principle of cloud resource allocation on demand but also can give full play to the advantages of cloud resources and improve the throughput of the whole cloud system and the satisfaction of cloud users.


Author(s):  
Shailendra Raghuvanshi ◽  
Priyanka Dubey

Load balancing of non-preemptive independent tasks on virtual machines (VMs) is an important aspect of task scheduling in clouds. Whenever certain VMs are overloaded and remaining VMs are under loaded with tasks for processing, the load has to be balanced to achieve optimal machine utilization. In this paper, we propose an algorithm named honey bee behavior inspired load balancing, which aims to achieve well balanced load across virtual machines for maximizing the throughput. The proposed algorithm also balances the priorities of tasks on the machines in such a way that the amount of waiting time of the tasks in the queue is minimal. We have compared the proposed algorithm with existing load balancing and scheduling algorithms. The experimental results show that the algorithm is effective when compared with existing algorithms. Our approach illustrates that there is a significant improvement in average execution time and reduction in waiting time of tasks on queue using workflowsim simulator in JAVA.


Author(s):  
Mohammed Mahfoudi ◽  
Moulhime El Bekkali ◽  
Abdellah Najid ◽  
Mohamed El Ghazi ◽  
Said Mazer

2015 ◽  
Vol E98.B (2) ◽  
pp. 352-359 ◽  
Author(s):  
Ping WANG ◽  
Lei DING ◽  
Huifang PANG ◽  
Fuqiang LIU ◽  
Nguyen Ngoc VAN

Sign in / Sign up

Export Citation Format

Share Document