Energy and Performance Efficient Underloading Detection Algorithm of Virtual Machines in Cloud Data Centers

2016 ◽  
Author(s):  
Juan Fang ◽  
Lifu Zhou ◽  
Xiaoting Hao ◽  
Min Cai ◽  
Xingtian Ren
Keyword(s):  
Data Centers ◽  
Virtual Machines ◽  
Detection Algorithm ◽  
Cloud Data ◽  
Cloud Data Centers ◽  
And Performance

scholarly journals A Novel Physical Machine Overload Detection Algorithm Combined with Quiescing for Dynamic Virtual Machine Consolidation in Cloud Data Centers

2019 ◽  
Vol 17 (3) ◽  
pp. 358-366
Author(s):  
Loiy Alsbatin ◽  
Gürcü Öz ◽  
Ali Ulusoy
Keyword(s):  
Virtual Machine ◽  
Data Centers ◽  
Virtual Machines ◽  
Energy Performance ◽  
Detection Algorithm ◽  
Vm Migration ◽  
Cloud Data ◽  
Detection Algorithms ◽  
Physical Machine ◽  
Cloud Data Centers

Further growth of computing performance has been started to be limited due to increasing energy consumption of cloud data centers. Therefore, it is important to pay attention to the resource management. Dynamic virtual machines consolidation is a successful approach to improve the utilization of resources and energy efficiency in cloud environments. Consequently, optimizing the online energy-performance trade off directly influences Quality of Service (QoS). In this paper, a novel approach known as Percentage of Overload Time Fraction Threshold (POTFT) is proposed that decides to migrate a Virtual Machine (VM) if the current Overload Time Fraction (OTF) value of Physical Machine (PM) exceeds the defined percentage of maximum allowed OTF value to avoid exceeding the maximum allowed resulting OTF value after a decision of VM migration or during VM migration. The proposed POTFT algorithm is also combined with VM quiescing to maximize the time until migration, while meeting QoS goal. A number of benchmark PM overload detection algorithms is implemented using different parameters to compare with POTFT with and without VM quiescing. We evaluate the algorithms through simulations with real world workload traces and results show that the proposed approaches outperform the benchmark PM overload detection algorithms. The results also show that proposed approaches lead to better time until migration by keeping average resulting OTF values less than allowed values. Moreover, POTFT algorithm with VM quiescing is able to minimize number of migrations according to QoS requirements and meet OTF constraint with a few quiescings.

An Energy-Efficient Consolidation of Virtual Machines in Cloud Data Centers

2017 ◽  
Vol 26 (1) ◽  
pp. 113-128
Author(s):  
Gamal Eldin I. Selim ◽  
Mohamed A. El-Rashidy ◽  
Nawal A. El-Fishawy
Keyword(s):  
Energy Efficient ◽  
Data Centers ◽  
Virtual Machines ◽  
Cloud Data ◽  
Cloud Data Centers

scholarly journals Virtual Machine Placement via Bin Packing in Cloud Data Centers

Electronics ◽  
2018 ◽  
Vol 7 (12) ◽  
pp. 389 ◽  
Author(s):  
Aisha Fatima ◽  
Nadeem Javaid ◽  
Tanzeela Sultana ◽  
Waqar Hussain ◽  
Muhammad Bilal ◽  
...  
Keyword(s):  
Particle Swarm Optimization ◽  
Data Centers ◽  
Bin Packing ◽  
Virtual Machines ◽  
Particle Swarm ◽  
Vm Placement ◽  
Swarm Optimization ◽  
Cloud Data ◽  
Cloud Data Centers ◽  
Vm Consolidation

With the increasing size of cloud data centers, the number of users and virtual machines (VMs) increases rapidly. The requests of users are entertained by VMs residing on physical servers. The dramatic growth of internet services results in unbalanced network resources. Resource management is an important factor for the performance of a cloud. Various techniques are used to manage the resources of a cloud efficiently. VM-consolidation is an intelligent and efficient strategy to balance the load of cloud data centers. VM-placement is an important subproblem of the VM-consolidation problem that needs to be resolved. The basic objective of VM-placement is to minimize the utilization rate of physical machines (PMs). VM-placement is used to save energy and cost. An enhanced levy-based particle swarm optimization algorithm with variable sized bin packing (PSOLBP) is proposed for solving the VM-placement problem. Moreover, the best-fit strategy is also used with the variable sized bin packing problem (VSBPP). Simulations are done to authenticate the adaptivity of the proposed algorithm. Three algorithms are implemented in Matlab. The given algorithm is compared with simple particle swarm optimization (PSO) and a hybrid of levy flight and particle swarm optimization (LFPSO). The proposed algorithm efficiently minimized the number of running PMs. VM-consolidation is an NP-hard problem, however, the proposed algorithm outperformed the other two algorithms.

Multidimensional Resource Scheduling in Cloud Data Centers

2014 ◽  
Vol 1008-1009 ◽  
pp. 1513-1516
Author(s):  
Hai Na Song ◽  
Xiao Qing Zhang ◽  
Zhong Tang He
Keyword(s):  
Cloud Computing ◽  
Data Centers ◽  
Bin Packing ◽  
Virtual Machines ◽  
Three Dimensional ◽  
Resource Scheduling ◽  
Computing Environment ◽  
Cloud Computing Environment ◽  
Cloud Data ◽  
Cloud Data Centers

Cloud computing environment is regarded as a kind of multi-tenant computing mode. With virtulization as a support technology, cloud computing realizes the integration of multiple workloads in one server through the package and seperation of virtual machines. Aiming at the contradiction between the heterogeneous applications and uniform shared resource pool, using the idea of bin packing, the multidimensional resource scheduling problem is analyzed in this paper. We carry out some example analysis in one-dimensional resource scheduling, two-dimensional resource schduling and three-dimensional resource scheduling. The results shows that the resource utilization of cloud data centers will be improved greatly when the resource sheduling is conducted after reorganizing rationally the heterogeneous demands.

Bandwidth allocation for communicating virtual machines in cloud data centers

2020 ◽  
Vol 76 (9) ◽  
pp. 7268-7289
Author(s):  
Kamalesh Karmakar ◽  
Rajib K. Das ◽  
Sunirmal Khatua
Keyword(s):  
Bandwidth Allocation ◽  
Data Centers ◽  
Virtual Machines ◽  
Cloud Data ◽  
Cloud Data Centers

scholarly journals Virtual Machine Consolidation with Minimization of Migration Thrashing for Cloud Data Centers

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Xialin Liu ◽  
Junsheng Wu ◽  
Gang Sha ◽  
Shuqin Liu
Keyword(s):  
Virtual Machine ◽  
Carbon Dioxide Emissions ◽  
Data Centers ◽  
Virtual Machines ◽  
Service Level Agreement ◽  
High Capacity ◽  
Electrical Energy ◽  
Cloud Data ◽  
Cloud Data Centers ◽  
Vm Consolidation

Cloud data centers consume huge amount of electrical energy bringing about in high operating costs and carbon dioxide emissions. Virtual machine (VM) consolidation utilizes live migration of virtual machines (VMs) to transfer a VM among physical servers in order to improve the utilization of resources and energy efficiency in cloud data centers. Most of the current VM consolidation approaches tend to aggressive-migrate for some types of applications such as large capacity application such as speech recognition, image processing, and decision support systems. These approaches generate a high migration thrashing because VMs are consolidated to servers according to VM’s instant resource usage without considering their overall and long-term utilization. The proposed approach, dynamic consolidation with minimization of migration thrashing (DCMMT) which prioritizes VM with high capacity, significantly reduces migration thrashing and the number of migrations to ensure service-level agreement (SLA) since it keeps VMs likely to suffer from migration thrashing in the same physical servers instead of migrating. We have performed experiments using real workload traces compared to existing aggressive-migration-based solutions; through simulations, we show that our approach improves migration thrashing metric by about 28%, number of migrations metric by about 21%, and SLAV metric by about 19%.

Sign in / Sign up

Export Citation Format

Share Document