基于自适应过载阈值选择的虚拟机动态整合方法

针对云环境下动态工作负载的不确定性,提出了基于自适应过载阈值选择的虚拟机动态整合方法。为了权衡数据中心能源有效性与服务质量间的关系,将自适应过载阈值的选择问题建模为马尔可夫决策过程,计算过载阈值的最优选择策略,并根据系统能效和服务质量调整阈值。通过过载阈值检测过载物理主机,然后根据最小迁移时间原则以及最小能耗增加放置原则确定虚拟机的迁移策略,最后切换轻负载物理主机至休眠状态完成虚拟机整合。仿真实验结果表明,所提出的方法在减少虚拟机迁移次数方面效果显著,在节约数据中心能源开销与保证服务质量方面表现良好,在能源的有效性与云服务质量二者之间取得了比较理想的平衡。     

面向数据中心的虚拟机部署及优化算法

虚拟机动态配置是解决数据中心能耗低效的有效方法。针对动态配置过程中的虚拟机部署及优化问题展开研究,提出一种新的面向系统能耗的虚拟机部署算法以及基于主动迁移的优化策略。为了降低系统能耗,新算法采用基于服务器利用率的最佳适配降序算法求解虚拟机部署方案;同时为了适应应用负载的动态变化,新算法启动主动迁移策略对部署方案进行优化,即通过启发式算法在当前部署的基础上搜索使系统能耗更低的优化方案,并根据新部署对虚拟机执行主动迁移。考虑到迁移会导致应用服务质量降级和额外能耗,新算法通过在优化策略中设置基于服务器利用率的启动门限,对虚拟机主动迁移频率进行控制。仿真实验表明,所提算法在系统能耗、虚拟机迁移频率、服务器状态切换频率以及服务质量等多项性能指标上均有显著提高     

基于混合群智能的节能虚拟机整合方法

数据中心的虚拟机（virtual machine,VM）整合技术是当今云计算领域的一个研究热点.要在保证服务质量（QoS）的前提下尽可能地降低云数据中心的服务器能耗,本质上是一个多目标优化的NP难问题.为了更好地解决该问题,面向异构服务器云环境提出了一种基于差分进化与粒子群优化的混合群智能节能虚拟机整合方法（HSI-VMC）.该方法包括基于峰值效能比的静态阈值超载服务器检测策略（PEBST）、基于迁移价值比的待迁移虚拟机选择策略（MRB）、目标服务器选择策略、混合离散化启发式差分进化粒子群优化虚拟机放置算法（HDH-DEPSO）以及基于负载均值的欠载服务器处理策略（AVG）.其中,PEBST,MRB,AVG策略的结合能够根据服务器的峰值效能比和CPU的负载均值检测出超载和欠载服务器,并选出合适的虚拟机进行迁移,降低负载波动引起的服务水平协议违约率（SLAV）和虚拟机迁移的次数;HDH-DEPSO算法结合DE和PSO的优点,能够搜索出更优的虚拟机放置方案,使服务器尽可能地保持在峰值效能比下运行,降低服务器的能耗开销.基于真实云环境数据集（PlanetLab/Mix/Gan）的一系列实验结果表明：HSI-VMC方法与当前主流的几种节能虚拟机整合方法相比,能够更好地兼顾多个QoS指标,并有效地降低云数据中心的服务器能耗开销.     

DataABC: A fast ABC based energy-efficient live VM consolidation policy with data-intensive energy evaluation model

Live Virtual Machine (VM) consolidation is an effective method of improving energy-efficiency level in green data centers. Currently, to evaluate energy consumption in green data centers, energy-efficiency evaluation model with CPU utilization rate has been proposed. However, it is not suitable for data-intensive computing due to great energy consumption by GPU-intensive processing. In this paper, we have proposed a new energy evaluation model with CPU and GPU utilization rates. There are two kinds of policies in live VM consolidation: one for VM selection and the other for VM allocation. Some researchers have proposed their solutions based on VM selection policy or VM allocation policy respectively. However, it will be a better energy-efficiency VM consolidation policy if these two polices are integrated together. Based on these two policies, a fast Artificial Bee Colony (ABC) based energy-efficiency live VM consolidation policy with data-intensive energy model, named as DataABC, is proposed. DataABC adopts the idea of Artificial Bee Colony algorithm to get a fast and global optimized decision of VM consolidation. Compared with two state-of-art policies of PS-ABC and PS-ES, the total energy consumption of DataABC evidently drop by 9.72% and 5.84% respectively. As a result, based on the ESV metric, the DataABC approach has proved that (a) the energy-efficiency evaluation model with data-intensive computing is valid and that (b) DataABC can save energy with a good Quality of Service (QoS) in green data centers.     

基于虚拟机调度的数据中心节能优化

随着数据中心的快速发展,其能耗问题已经愈发突出,数据中心节能机制已成为研究热点;但大多节能机制并未充分考虑数据中心的异构性,如不同时间购置的服务器之间存在差异。为此引入代表服务器能耗效率的能效比(Performance/Power)作为参数,提出一种基于虚拟机调度的节能算法PVMAP,动态整合虚拟机时优先充分使用能效比高的服务器,从而尽量减少虚拟机迁移次数和同时运行的服务器数量。仿真实验结果表明,算法能够在节能的同时保证服务质量(QoS),比其他算法具有更好的稳定性和可扩展性。     

Towards Automated Provisioning and Emergency Handling in Renewable Energy Powered Datacenters

Designing eco-friendly system has been at the forefront of computing research. Faced with a growing concern about the server energy expenditure and the climate change, both industry and academia start to show high interest in computing systems powered by renewable energy sources. Existing proposals on this issue mainly focus on optimizing resource utilization or workload performance. The key supporting hardware structures for cross-layer power management and emergency handling mechanisms are often left unexplored. This paper presents GreenPod, a research framework for exploring scalable and dependable renewable power management in datacenters. An important feature of GreenPod is that it enables joint management of server power supplies and virtualized server workloads. Its interactive communication portal between servers and power supplies allows dataeenter operators to perform real-time renewable energy driven load migration and power emergency handling. Based on our system prototype, we discuss an important topic： virtual machine （VM） workloads survival when facing extended utility outage and insufficient onsite renewable power budget. We show that whether a VM can survive depends on the operating frequencies and workload characteristics. The proposed framework can greatly encourage and facilitate innovative research in dependable green computing.     

Bayes Theorem Based Virtual Machine Scheduling for Optimal Energy Consumption

This paper proposes an algorithm for scheduling Virtual Machines (VM) with energy saving strategies in the physical servers of cloud data centers. Energy saving strategy along with a solution for productive resource utilization for VM deployment in cloud data centers is modeled by a combination of “Virtual Machine Scheduling using Bayes Theorem” algorithm (VMSBT) and Virtual Machine Migration (VMMIG) algorithm. It is shown that the overall data center’s consumption of energy is minimized with a combination of VMSBT algorithm and Virtual Machine Migration (VMMIG) algorithm. Virtual machine migration between the active physical servers in the data center is carried out at periodical intervals as and when a physical server is identified to be under-utilized. In VM scheduling, the optimal data centers are clustered using Bayes Theorem and VMs are scheduled to appropriate data center using the selection policy that identifies the cluster with lesser energy consumption. Clustering using Bayes rule minimizes the number of server choices for the selection policy. Application of Bayes theorem in clustering has enabled the proposed VMSBT algorithm to schedule the virtual machines on to the physical server with minimal execution time. The proposed algorithm is compared with other energy aware VM allocations algorithms viz. “Ant-Colony” optimization-based (ACO) allocation scheme and “min-min” scheduling algorithm. The experimental simulation results prove that the proposed combination of ‘VMSBT’ and ‘VMMIG’ algorithm outperforms other two strategies and is highly effective in scheduling VMs with reduced energy consumption by utilizing the existing resources productively and by minimizing the number of active servers at any given point of time.     

Efficient Energy-Aware Resource Management Model (EEARMM) Based Dynamic VM Migration

In cloud environment, an efficient resource management establishes the allocation of computational resources of cloud service providers to the requests of users for meeting the user’s demands. The proficient resource management and work allocation determines the accomplishment of the cloud infrastructure. However, it is very difficult to persuade the objectives of the Cloud Service Providers (CSPs) and end users in an impulsive cloud domain with random changes of workloads, huge resource availability and complicated service policies to handle them, With that note, this paper attempts to present an Efficient Energy-Aware Resource Management Model (EEARMM) that works in a decentralized manner. Moreover, the model involves in reducing the number of migrations by definite workload management for efficient resource utilization. That is, it makes an effort to reduce the amount of physical devices utilized for load balancing with certain resource and energy consumption management of every machine. The Estimation Model Algorithm (EMA) is given for determining the virtual machine migration. Further, VM-Selection Algorithm (SA) is also provided for choosing the appropriate VM to migrate for resource management. By the incorporation of these algorithms, overloading of VM instances can be avoided and energy efficiency can be improved considerably. The performance evaluation and comparative analysis, based on the dynamic workloads in different factors provides evidence to the efficiency, feasibility and scalability of the proposed model in cloud domain with high rate of resources and workload management.     

Cost-effective resource provisioning for multimedia cloud-based e-health systems

Recently, multimedia cloud is being considered as a new effective serving mode in e-Health area that meets the requirement of scalable and economic multimedia service for e-health. It can provide a flexible stack of powerful Virtual Machine (VM) resources of cloud like CPU, memory, storage, network bandwidth etc. on demand to manage e-health media services and applications (e.g. medical image/video retrieval, health video transcoding, streaming, video rendering, sharing and delivery) at lower cost. However, one major issue here is how to efficiently allocate VM resources dynamically based on e-health applications’ QoS demands and support energy and cost savings by optimizing the number of servers in use. In order to solve this problem, we propose a cost effective and dynamic VM allocation model based on Nash bargaining solution. With extensive simulations it is shown that the proposed mechanism can reduce the overall cost of running servers while at the same time guarantee QoS demand and maximize resource utilization in various dimensions of server resources.     

基于三支决策的虚拟机节能迁移策略

虚拟机迁移技术作为云计算中降低数据中心能耗的重要手段被广泛应用。结合三支决策的分、治、效模型提出一种基于三支决策的虚拟机迁移调度策略（TWD-VMM）。首先,通过建立层次阈值树搜索所有可能取到的阈值,由此以数据中心能耗为优化目标得到总能耗最低的一对阈值,从而实现三分区域,即高负载区域、中负载区域和低负载区域。其次,针对不同负载的主机采取不同的迁移策略：对于高负载主机,以主机预迁出后的多维资源均衡度和主机负载下降幅度为目标;对于低负载主机,主要考虑主机预放置后的多维资源均衡度;对于中等负载主机,如果迁移过来的虚拟机依旧满足中负载特性,则可以接受迁入。实验采用CloudSim模拟器进行,将TWD-VMM算法分别与基于阈值调度算法（TVMS）、基于虚拟机迁移节能调度算法（EEVS）、云计算中心节能调度算法（REVMS）算法在主机负载、主机多维资源利用均衡度、数据中心总能耗等方面进行比较,结果表明TWD-VMM算法在提高主机资源利用率、均衡主机负载等方面有明显效果,且能耗平均降低了27%。     

虚拟化云计算数据中心能量感知资源分配机制

针对云计算的资源管理问题,提出了云计算数据中心的能量模型以及四个虚拟机放置算法。首先计算每个机架上主机的负载并根据设定的阈值进行归类,然后采用最少迁移策略从主机上选择合适迁移的虚拟机并且接受新的虚拟机分配请求,对每个虚拟机与主机集合进行匹配,选择最优化的主机进行放置。实验结果表明,与现有的能量感知资源分配方法相比,该方法在主机、网络设备以及冷却系统方面能量利用率分别提高了2.4%,18.5%和28.1%,总的能量利用率平均提高了14.5%。     

一种新的蚁群算法优化的虚拟机放置策略

提出了一种新的蚁群算法优化的虚拟机放置策略ACA-VMP (Ant Colony Algorithm based virtual machine placement);ACA-VMP以云数据中心的总体能量消耗降低、服务质量最佳及减少虚拟机迁移次数为目标函数;根据蚁群优化算法,ACA-VMP采用了全局最优解和局部最优解信息素强度更新规则;全局最优解经过多次迭代后,蚂蚁路径的多次寻优,保证这个虚拟机放置优化策略的完成;局部信息素强度参数更新可以补充蚂蚁其他局部最优路径的寻找,这样也可以使得ACA-VMP虚拟机放置优化算法更快的接近全局最优解;仿真结果表明:ACA-VMP策略使得云数据中心的各类性能指标都可以改善,该实验结果对于其他企业构造节能云数据中心有很好的参考价值.     

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.     

基于拍卖的虚拟机动态供应和分配算法

当前云计算供应商通过定价算法或类似拍卖的算法来分配他们的虚拟机（VM）实例。然而,这些算法大多要求虚拟机静态供应,无法准确预测用户需求,导致资源未得到充分利用。为此,提出了一种基于组合拍卖的虚拟机动态供应和分配算法,在做出虚拟机供应决策时考虑用户对虚拟机的需求。该算法将可用的计算资源看成是“流体”资源,且这些资源根据用户请求可分为不同数量、不同类型的虚拟机实例。然后可根据用户的估价决定分配策略,直到所有资源分配完毕。基于Parallel Workload Archive（并行工作负载存档）的真实工作负载数据进行了仿真实验,结果表明该方法可保证为云供应商带来更高收入,提高资源利用率。     

Prediction of job characteristics for intelligent resource allocation in HPC systems: a survey and future directions

Nowadays, high-performance computing (HPC) clusters are increasingly popular. Large volumes of job logs recording many years of operation traces have been accumulated. In the same time, the HPC cloud makes it possible to access HPC services remotely. For executing applications, both HPC end-users and cloud users need to request specific resources for different workloads by themselves. As users are usually not familiar with the hardware details and software layers, as well as the performance behavior of the underlying HPC systems. It is hard for them to select optimal resource configurations in terms of performance, cost, and energy efficiency. Hence, how to provide on-demand services with intelligent resource allocation is a critical issue in the HPC community. Prediction of job characteristics plays a key role for intelligent resource allocation. This paper presents a survey of the existing work and future directions for prediction of job characteristics for intelligent resource allocation in HPC systems. We first review the existing techniques in obtaining performance and energy consumption data of jobs. Then we survey the techniques for single-objective oriented predictions on runtime, queue time, power and energy consumption, cost and optimal resource configuration for input jobs, as well as multi-objective oriented predictions. We conclude after discussing future trends, research challenges and possible solutions towards intelligent resource allocation in HPC systems.     

基于DQN的超密集网络能效资源管理

小基站的密集随机部署会产生严重干扰和较高能耗问题,为降低网络干扰、保证用户网络服务质量（QoS）并提高网络能效,构建一种基于深度强化学习（DRL）的资源分配和功率控制联合优化框架。综合考虑超密集异构网络中的同层干扰和跨层干扰,提出对频谱与功率资源联合控制能效以及用户QoS的联合优化问题。针对该联合优化问题的NP-Hard特性,提出基于DRL框架的资源分配和功率控制联合优化算法,并定义联合频谱和功率分配的状态、动作以及回报函数。利用强化学习、在线学习和深度神经网络线下训练对网络资源进行控制,从而找到最佳资源和功率控制策略。仿真结果表明,与枚举算法、Q-学习算法和两阶段算法相比,该算法可在保证用户QoS的同时有效提升网络能效。     

基于数据中心的两阶段虚拟机能效优化部署算法

针对数据中心在虚拟机动态部署过程中的高能耗问题,提出了面向数据中心的两阶段虚拟机能效优化部署算法--DVMP_VMMA。第一阶段为初始部署,提出了动态虚拟机部署(DVMP)算法限定主机最优部署数量,降低了闲置能耗;同时,为了应对负载的动态变化,第二阶段提出迁移约束的虚拟机迁移算法(VMMA)对初始部署方案作进一步优化,这样不仅得到的系统能耗更低,而且还能保证应用服务质量。与满载算法(FL)、基于固定门限值的部署算法(FT),绝对中位差部署算法(MAD)、四分位差部署算法(QD)、迁移周期最优算法(MTM)、最小占用率迁移算法(MIU)进行的比较实验结果表明:DVMP_VMMA不仅考虑了系统能耗优化,使运行时资源利用率更高;而且还可以避免VM频繁迁移完成对性能的提升,其在优化数据中心能耗、SLA违例、VM迁移量的控制及性能损失等指标上均有较好效果,其综合性能优于对比算法。     

Priority scheduling with consolidation based backfilling algorithm in cloud

In cloud computing, scheduling plays an eminent role while processing enormous jobs. The paralle jobs utmost need parallel processing capabilities which leads to CPU underutilization mainly due to synchronization and communication among parallel processes. Researchers introduced several algorithms for scheduleing parallel jobs namely, Conservative Migration Consolidation supported Backfilling (CMCBF) and Aggressive Migration Consolidation supported Backfilling (AMCBF). The greatest challenge of a existing scheduling algorithm is to improve the data center utilization without affecting job responsiveness. Hence, this work proposes an Effective Multiphase Scheduling Approach (EMSA) to process the jobs. In EMSA, the jobs are initially preprocessed and batched together to avoid starvation and to mitigate unwanted delay. Later, an Associate Priority Method has been proposed which prioritizes the batch jobs to minimize the number of migrations. Finally, the prioritized jobs are scheduled using Priority Scheduling with BackFilling algorithm to utilize the intermediate idle nodes. Moreover, the virtualization technology partitions the computing capacity of the Virtual Machine (VM) into two-tier VM as foreground VM (FVM) and Background VM (BVM) to improve node utilization. Hence, Priority Scheduling with Consolidation based BackFilling algorithm has been deployed in a two-tier VM that processes the jobs by utilizing the VMs effectively. Experimental results show that the performance of the proposed work performs better than other existing algorithms by increasing the resource utilization by 8%.     

Decentralized cloud datacenter reconsolidation through emergent and topology-aware behavior

Consolidation of multiple applications on a single Physical Machine (PM) within a cloud data center can increase utilization, minimize energy consumption, and reduce operational costs. However, these benefits come at the cost of increasing the complexity of the scheduling problem.In this paper, we present a topology-aware resource management framework. As part of this framework, we introduce a Reconsolidating PlaceMent scheduler (RPM) that provides and maintains durable allocations with low maintenance costs for data centers with dynamic workloads. We focus on workloads featuring both short-lived batch jobs and latency-sensitive services such as interactive web applications. The scheduler assigns resources to Virtual Machines (VMs) and maintains packing efficiency while taking into account migration costs, topological constraints, and the risk of resource contention, as well as the variability of the background load and its complementarity to the new VM.We evaluate the model by simulating a data center with over 65,000 PMs, structured as a three-level multi-rooted tree topology. We investigate trade-offs between factors that affect the durability and operational cost of maintaining a near-optimal packing. The results show that the proposed scheduler can scale to the number of PMs in the simulation and maintain efficient utilization with low migration costs.     

基于访问量预测的数据中心自适应节能机制

为能在保证服务质量的前提下提高数据中心能源利用率,提出一种基于用户访问量预测的数据中心虚拟机自适应节能机制,根据自适应Holt-Winters(AHW)预测法研究互联网用户访问行为的周期性,使其能根据用户访问量自适应地调整虚拟机数量以提高虚拟机的利用率,达到减少数据中心能耗的目的。仿真实验结果显示,AHW预测法最高平均绝对百分误差为22.46%,基于AHW预测法的数据中心虚拟机利用率为97.88%,相比未采用节能机制时提高了37.19%,从而证明该节能机制对周期性用户访问进行预测时具有较好的统计性能和较强的鲁棒性,能更好地满足数据中心节能的需求。