基于负载不确定性的虚拟机整合方法

物理主机工作负载的不确定性容易造成物理主机过载和资源利用率低,从而影响数据中心的能源消耗和服务质量。针对该问题,通过分析物理主机的工作负载记录与虚拟机资源请求的历史数据,提出了基于负载不确定性的虚拟机整合（WU-VMC）方法。为了稳定云数据中心各主机的工作负载,该方法首先利用虚拟机的资源请求拟合物理主机工作负载,并利用梯度下降方法计算虚拟机与物理主机的虚拟机匹配度;然后,利用匹配度进行虚拟机整合,从而解决负载不确定造成的能耗增加和服务质量下降等问题。仿真实验结果表明,WU-VMC方法降低了数据中心的能源消耗,减少了虚拟机迁移次数,提高了数据中心的资源利用率及服务质量。     

Distributed virtual machine consolidation: A systematic mapping study

Background:Virtual Machine (VM) consolidation is an effective technique to improve resource utilization and reduce energy footprint in cloud data centers. It can be implemented in a centralized or a distributed fashion. Distributed VM consolidation approaches are currently gaining popularity because they are often more scalable than their centralized counterparts and they avoid a single point of failure.Objective:To present a comprehensive, unbiased overview of the state-of-the-art on distributed VM consolidation approaches.Method:A Systematic Mapping Study (SMS) of the existing distributed VM consolidation approaches.Results:19 papers on distributed VM consolidation categorized in a variety of ways. The results show that the existing distributed VM consolidation approaches use four types of algorithms, optimize a number of different objectives, and are often evaluated with experiments involving simulations.Conclusion:There is currently an increasing amount of interest on developing and evaluating novel distributed VM consolidation approaches. A number of research gaps exist where the focus of future research may be directed.     

Improving performance of similarity-based clustering by featureweight learning

Similarity-based clustering is a simple but powerful technique which usually results in a clustering graph for a partitioning of threshold values in the unit interval. The guiding principle of similarity-based clustering is "similar objects are grouped in the same cluster." To judge whether two objects are similar, a similarity measure must be given in advance. The similarity measure presented in the paper is determined in terms of the weighted distance between the features of the objects. Thus, the clustering graph and its performance (which is described by several evaluation indices defined in the paper) will depend on the feature weights. The paper shows that, by using gradient descent technique to learn the feature weights, the clustering performance can be significantly improved. It is also shown that our method helps to reduce the uncertainty (fuzziness and nonspecificity) of the similarity matrix. This enhances the quality of the similarity-based decision making     

Improving network systems performance by clustering distributed database sites

Clustering network sites is a vital issue in parallel and distributed database systems DDBS. Grouping distributed database network sites into clusters is considered an efficient way to minimize the communication time required for query processing. However, clustering network sites is still an open research problem since its optimal solution is NP-complete. The main contribution in this field is to find a near optimal solution that groups distributed database network sites into disjoint clusters in order to minimize the communication time required for data allocation. Grouping a large number of network sites into a small number of clusters effectively increases the transaction response time, results in better data distribution, and improves the distributed database system performance. We present a novel algorithm for clustering distributed database network sites based on the communication time as database query processing is time dependent. Extensive experimental tests and simulations are conducted on this clustering algorithm. The experimental and simulation results show that a better network distribution is achieved with significant network servers load balance and network delay, a minor communication time between network sites is realized, and a higher distributed database system performance is recognized.     

基于K最近邻回归预测的高能效虚拟机合并

虚拟机合并和迁移仅考虑当前负载会导致过多非必要迁移,为此,提出基于资源利用预测的虚拟机合并算法UP-BFD.通过K最近邻回归方法同时对主机和虚拟机的负载进行预测,在虚拟机迁移源主机和目标主机的选择上,同步考虑当前超载和预测超载问题,较好避免无用虚拟机迁移.通过随机负载和现实负载进行仿真测试,测试结果表明,UP-BFD算...     

An energy-aware heuristic framework for virtual machine consolidation in Cloud computing

Virtual machine (VM) consolidation in Cloud computing provides a great opportunity for energy saving. However, the obligation of providing suitable quality of service to end users leads to the necessity in dealing with energy-performance tradeoff. In this paper, we propose a redesigned energy-aware heuristic framework for VM consolidation to achieve a better energy-performance tradeoff. There are two main contributions in the framework: (1) establish a service level agreement (SLA) violation decision algorithm to decide whether a host is overload with SLA violation; (2) minimum power and maximum utilization policy is then proposed to improve the Minimum Power policy in previous work. Finally, we have evaluated our framework through simulation on large-scale experiments driven by workload traces from more than a thousand VMs, and the results show that our framework outperforms previous work. Specifically, it guarantees 21–34 % decrease in energy consumption, 84–92 % decrease in SLA violation, 87–94 % decrease in energy-performance metric, and 63 % decrease in execution time. And we further discuss why the redesigned framework outperforms the previous design.     

Multi-objective dynamic virtual machine consolidation in the cloud using ant colony system

In this paper, we present a novel multi-objective ant colony system algorithm for virtual machine (VM) consolidation in cloud data centres. The proposed algorithm builds VM migration plans, which are then used to minimise over-provisioning of physical machines (PMs) by consolidating VMs on under-utilised PMs. It optimises two objectives that are ordered by their importance. The first and foremost objective in the proposed algorithm is to maximise the number of released PMs. Moreover, since VM migration is a resource-intensive operation, it also tries to minimise the number of VM migrations. The proposed algorithm is empirically evaluated in a series of experiments. The experimental results show that the proposed algorithm provides an efficient solution for VM consolidation in cloud data centres. Moreover, it outperforms two existing ant colony optimization-based VM consolidation algorithms in terms of number of released PMs and number of VM migrations.     

Exploiting ensemble techniques for automatic virtual machine clustering in cloud systems

Cloud computing has recently emerged as a new paradigm to provide computing services through large-size data centers where customers may run their applications in a virtualized environment. The advantages of cloud in terms of flexibility and economy encourage many enterprises to migrate from local data centers to cloud platforms, thus contributing to the success of such infrastructures. However, as size and complexity of cloud infrastructures grow, scalability issues arise in monitoring and management processes. Scalability issues are exacerbated because available solutions typically consider each virtual machine (VM) as a black box with independent characteristics, which is monitored at a fine-grained granularity level for management purposes, thus generating huge amounts of data to handle. We claim that scalability issues can be addressed by leveraging the similarity between VMs in terms of resource usage patterns. In this paper, we propose an automated methodology to cluster similar VMs starting from their resource usage information, assuming no knowledge of the software executed on them. This is an innovative methodology that combines the Bhattacharyya distance and ensemble techniques to provide a stable evaluation of similarity between probability distributions of multiple VM resource usage, considering both system- and network-related data. We evaluate the methodology through a set of experiments on data coming from an enterprise data center. We show that our proposal achieves high and stable performance in automatic VMs clustering, with a significant reduction in the amount of data collected which allows to lighten the monitoring requirements of a cloud data center.     

The effects of scheduling, workload type and consolidation scenarios on virtual machine performance and their prediction through optimized artificial neural networks

The aim of this paper is to study and predict the effect of a number of critical parameters on the performance of virtual machines (VMs). These parameters include allocation percentages, real-time scheduling decisions and co-placement of VMs when these are deployed concurrently on the same physical node, as dictated by the server consolidation trend and the recent advances in the Cloud computing systems. Different combinations of VM workload types are investigated in relation to the aforementioned factors in order to find the optimal allocation strategies. What is more, different levels of memory sharing are applied, based on the coupling of VMs to cores on a multi-core architecture. For all the aforementioned cases, the effect on the score of specific benchmarks running inside the VMs is measured. Finally, a black box method based on genetically optimized artificial neural networks is inserted in order to investigate the degradation prediction ability a priori of the execution and is compared to the linear regression method.     

A reliable energy-aware approach for dynamic virtual machine consolidation in cloud data centers

The Journal of Supercomputing - To achieve energy efficiency in data centers, dynamic virtual machine (VM) consolidation as a key technique has become increasingly important nowadays due to the...     

Improving the performance of distributed virtual environment systems

The last years have witnessed a dramatic growth in the number as well as in the variety of distributed virtual environment systems. These systems allow multiple users, working on different client computers that are interconnected through different networks, to interact in a shared virtual world. One of the key issues in the design of scalable and cost-effective DVE systems is the partitioning problem. This problem consists of efficiently assigning the existing clients to the servers in the system and some techniques have been already proposed for solving it. This paper experimentally analyzes the correlation of the quality function proposed in the literature for solving the partitioning problem with the performance of DVE systems. Since the results show an absence of correlation, we also propose the experimental characterization of DVE systems. The results show that the reason for that absence of correlation is the nonlinear behavior of DVE systems with regard to the number of clients in the system. DVE systems reach saturation when any of the servers reaches 100 percent of CPU utilization. The system performance greatly decreases if this limit is exceeded in any server. Also, as a direct application of these results, we present a partitioning method that is targeted to keep all the servers in the system below a certain threshold value of CPU utilization, regardless of the amount of network traffic. Evaluation results show that the proposed partitioning method can improve DVE system performance, regardless of both the movement pattern of clients and the initial distribution of clients in the virtual world.     

基于混合并发模式的Dalvik虚拟机性能优化

为了改进Dalvik虚拟机的性能,提出了一种基于多线程调度机制的Java虚拟机混合并发模式。该模式利用多线程并发调度和热方法表,通过将Java字节码的编译与执行过程相重叠来提高程序的执行效率,进而提升Dalvik虚拟机的处理速度;并对该模式设计与实现的关键技术进行了分析。实验结果表明,混合并发模式能够有效地提高Dalvik虚拟机中Java程序的执行速度。     

基于虚拟机技术的高性能手机游戏平台

介绍了基于虚拟机的高性能手机游戏平台vGame的架构,以及运行于J2ME环境的虚拟机vMachine和基于Python语法的高效动态脚本vScript,给出了vMachine和vScript的设计原理和实现方案.     

Adaptive Markov-based approach for dynamic virtual machine consolidation in cloud data centers with quality-of-service constraints

Dynamic virtual machine (VM) consolidation is one of the emerging technologies that has been considered for low-cost computing in cloud data centers. Quality-of-service (QoS) assurance is one of the challenging issues in the VM consolidation problem since it is directly affected by the increase of resource utilization due to the consolidations. In this paper, we take advantage of Markov chain models to propose a novel approach for VM consolidation that can be used to explicitly set a desired level of QoS constraint in a data center to ensure the QoS goals while improving system utilization. For this purpose, an energy-efficient and QoS-aware best fit decreasing algorithm for VM placement is proposed, which considers QoS objective when determining the location of a migrating VM. This algorithm employs an online transition matrix estimator method to deal with the nonstationary nature of real workload data. We also propose new policies for detecting overloaded and underloaded hosts. The performance of our proposed algorithms is evaluated through simulations. The results show that the proposed VM consolidation algorithms in this paper outperforms the benchmark algorithms in terms of energy consumption, service-level agreement violations, and other cost factors.     

Correction to: A reliable energy-aware approach for dynamic virtual machine consolidation in cloud data centers

The Journal of Supercomputing - The spelling of Monireh H. Sayadnavard’s family name was incorrect.     

云计算中能耗和性能感知的虚拟机优化部署算法

优化虚拟机部署是数据中心降低能耗的一个重要方法。目前大多数虚拟机部署算法都明显地降低了能耗,但过度虚拟机整合和迁移引起了系统性能较大的退化。针对该问题,首先构建虚拟机优化部署模型。然后提出一种二阶段迭代启发式算法来求解该模型,第一阶段是基于首次适应下降装箱算法,提出一种虚拟机优化部署算法,目标是最小化主机数;第二阶段是提出了一种虚拟机在线迁移选择算法,目标是最小化待迁移虚拟机数。实验结果表明,该算法能够有效地降低能耗,具有较低的服务等级协定(SLA)违背率和较好的时间性能。     

对超粒度混杂技术的改进：基于瘦虚拟机的指令集交替技术

超粒度混杂技术对于小型解密程序效率低下,为此提出了基于瘦虚拟机的指令集交替技术。该技术使用一个自动机来记录程序加密和解密的方法,并且使用瘦虚拟机来完成对加密过的程序解释执行。测试结果表时,该技术在保证加密强度的条件下,对效率有较大的提高。