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

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.

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Xialin Liu ◽  
Junsheng Wu ◽  
Gang Sha ◽  
Shuqin Liu

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%.


Sensors ◽  
2019 ◽  
Vol 19 (12) ◽  
pp. 2724 ◽  
Author(s):  
Yuan ◽  
Sun

High-energy consumption in data centers has become a critical issue. The dynamic server consolidation has significant effects on saving energy of a data center. An effective way to consolidate virtual machines is to migrate virtual machines in real time so that some light load physical machines can be turned off or switched to low-power mode. The present challenge is to reduce the energy consumption of cloud data centers. In this paper, for the first time, a server consolidation algorithm based on the culture multiple-ant-colony algorithm was proposed for dynamic execution of virtual machine migration, thus reducing the energy consumption of cloud data centers. The server consolidation algorithm based on the culture multiple-ant-colony algorithm (CMACA) finds an approximate optimal solution through a specific target function. The simulation results show that the proposed algorithm not only reduces the energy consumption but also reduces the number of virtual machine migration.


2020 ◽  
Author(s):  
Swasthi Shetty ◽  
Annappa B

<div> <div> <div> <p>Virtual machine consolidation techniques provide ways to save energy and cost in cloud data centers. However, aggressive packing of virtual machines can cause performance degradation. Therefore, it is essential to strike a trade-off between energy and performance in data centers. Achieving this trade-off has been an active research area in recent years. In this paper, a host underload detection algorithm and a new VM selection and VM placement techniques are proposed to consolidate Virtual machines based on the growth potential of VMs. Growth potential is calculated based on the utilization history of VMs. The interdependence of VM selection and VM placement techniques are also studied in the proposed model. The proposed algorithms are evaluated on real- world PlanetLab workload on Cloudsim. The experimental evaluation shows that our proposed technique reduces Service Level Agreement Violation (SLAV) and energy consumption compared to the existing algorithms. </p> </div> </div> </div>


Author(s):  
Cail Song ◽  
Bin Liang ◽  
Jiao Li

Recently, the virtual machine deployment algorithm uses physical machine less or consumes higher energy in data centers, resulting in declined service quality of cloud data centers or rising operational costs, which leads to a decrease in cloud service provider’s earnings finally. According to this situation, a resource clustering algorithm for cloud data centers is proposed. This algorithm systematically analyzes the cloud data center model and physical machine’s use ratio, establishes the dynamic resource clustering rules through k-means clustering algorithm, and deploys the virtual machines based on clustering results, so as to promote the use ratio of physical machine and bring down energy consumption in cloud data centers. The experimental results indicate that, regarding the compute-intensive virtual machines in cloud data centers, compared to contrast algorithm, the physical machine’s use ratio of this algorithm is improved by 12% on average, and its energy consumption in cloud data center is lowered by 15% on average. Regarding the general-purpose virtual machines in cloud data center, compared to contrast algorithm, the physical machine’s use ratio is improved by 14% on average, and its energy consumption in cloud data centers is lowered by 12% on average. Above results demonstrate that this method shows a good effect in the resource management of cloud data centers, which may provide reference to some extent.


T-Comm ◽  
2021 ◽  
Vol 15 (1) ◽  
pp. 28-34
Author(s):  
Andrew V. Toutov ◽  
◽  
Natalia V. Toutova ◽  
Anatoly S. Vorozhtsov ◽  
Iliya A. Andreev ◽  
...  

The problem of virtual machine placement on physical servers in cloud data centers is considered. The resource management system has a two-level architecture consisting of global and local controllers. Local controllers analyze the state of the physical servers on which they are located and determine possible underloading, overloading, and overheating states based on the forecast for the next observation window. If one of the listed states is detected, the local controller notifies the global controller, which selects the destination servers to host the virtual machines via migration. It is proposed to place virtual machines based on the criteria of minimum remaining unused resources and violation of SLA agreements. A mathematical formulation of the optimization problem is given, which is equivalent to the known main assignment problem in terms of structure, necessary conditions, and the nature of variables. Reducing the assignment problem to a closed transport problem allowed us to solve the problem of hosting virtual machines under many criteria in real time and significantly increase its dimension in comparison with heuristic algorithms, which makes it possible to maintain the quality of modern cloud services in the conditions of rapid growth of physical and virtual resources of data centers. The developed mathematical formulation of the problem and the results of computational experiments can be included in the mathematical software of virtual machine live migration.


2017 ◽  
Vol 16 (6) ◽  
pp. 6953-6961
Author(s):  
Kavita Redishettywar ◽  
Prof. Rafik Juber Thekiya

Cloud computing is a vigorous technology by which a user can get software, application, operating system and hardware as a service without actually possessing it and paying only according to the usage. Cloud Computing is a hot topic of research for the researchers these days. With the rapid growth of Interne technology cloud computing have become main source of computing for small as well big IT companies. In the cloud computing milieu the cloud data centers and the users of the cloud-computing are globally situated, therefore it is a big challenge for cloud data centers to efficiently handle the requests which are coming from millions of users and service them in an efficient manner. Load balancing ensures that no single node will be overloaded and used to distribute workload among multiple nodes. It helps to improve system performance and proper utilization of resources. We propose an improved load balancing algorithm for job scheduling in the cloud environment using K-Means clustering of cloudlets and virtual machines in the cloud environment. All the cloudlets given by the user are divided into 3 clusters depending upon client’s priority, cost and instruction length of the cloudlet. The virtual machines inside the datacenter hosts are also grouped into multiple clusters depending upon virtual machine capacity in terms of processor, memory, and bandwidth. Sorting is applied at both the ends to reduce the latency. Multiple number of experiments have been conducted by taking different configurations of cloudlets and virtual machine. Various parameters like waiting time, execution time, turnaround time and the usage cost have been computed inside the cloudsim environment to demonstrate the results. Compared with the other job scheduling algorithms, the improved load balancing algorithm can outperform them according to the experimental results.


Author(s):  
Mehran Tarahomi ◽  
Mohammad Izadi

<p>Energy usage of data centers is a challenging and complex issue because computing applications and data are growing so quickly that increasingly larger servers and disks are needed to process them fast enough within the required time period. In the past few years, many approaches to virtual machine placement have been proposed. This study proposes a new approach for virtual machine allocation to physical hosts. Either minimizes the physical hosts and avoids the SLA violation. The proposed method in comparison to the other algorithms achieves better results.</p>


2020 ◽  
Author(s):  
Swasthi Shetty ◽  
Annappa B

<div> <div> <div> <p>Virtual machine consolidation techniques provide ways to save energy and cost in cloud data centers. However, aggressive packing of virtual machines can cause performance degradation. Therefore, it is essential to strike a trade-off between energy and performance in data centers. Achieving this trade-off has been an active research area in recent years. In this paper, a host underload detection algorithm and a new VM selection and VM placement techniques are proposed to consolidate Virtual machines based on the growth potential of VMs. Growth potential is calculated based on the utilization history of VMs. The interdependence of VM selection and VM placement techniques are also studied in the proposed model. The proposed algorithms are evaluated on real- world PlanetLab workload on Cloudsim. The experimental evaluation shows that our proposed technique reduces Service Level Agreement Violation (SLAV) and energy consumption compared to the existing algorithms. </p> </div> </div> </div>


2017 ◽  
Vol 26 (1) ◽  
pp. 113-128
Author(s):  
Gamal Eldin I. Selim ◽  
Mohamed A. El-Rashidy ◽  
Nawal A. El-Fishawy

Sign in / Sign up

Export Citation Format

Share Document