基于拍卖的数据中心资源匹配算法

云平台数据中心主机与负载均具有异构性,导致任务负载无法均衡利用主机各项资源。主机资源的非均衡利用最终造成总体资源利用率低,主机资源浪费,提高运营成本。针对云平台数据中心任务分配中各项资源无法均衡利用的问题,提出一种基于连续双向拍卖的虚拟机分配与迁移算法。该算法一方面利用多种启发式策略对数据中心主机和虚拟机进行筛选,将过载主机与欠载主机放入数据中心拍卖中;另一方面,构建买卖双方定价策略以及交易策略,形成完整的拍卖流程。同时,为解决多资源情况下的交易问题,提出基于资源匹配度的交易策略。仿真实验表明,文中方法通过引入资源匹配度,能够有效地匹配数据中心主机与虚拟机的各项资源,平衡各类资源利用率,提高整体资源利用率。     

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

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

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

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

基于资源权重最大资源利用率的动态资源调度算法

对于在云环境下虚拟机放置问题,资源调度管理是其中一项关键技术,因而提出了一种基于最大综合利用率为标准的动态资源调度算法。首先,在云系统调度中心缓存用户的资源请求,将此请求当做一个任务,然后利用负载均衡调度算法,调度中心针对不同任务来分配适当的物理机,最后在物理机上建立虚拟等待队列,充分考虑云系统中计算资源权重比,利用基于权重最大资源利用率的算法进行虚拟机配置。仿真实验结果证明,该算法可以实现有效负载均衡,并在保证一定的QoS的情况下,能有效提高系统的综合利用率。     

负载相关的虚拟机放置策略

虚拟化技术抽象了物理计算资源层,将系统资源以资源池的方式进行集中管理,不仅提高了硬件资源利用率,而且可以提供按需服务,因此在企业服务器整合、数据中心、云计算平台中得到了广泛应用.为了满足峰值性能,传统多虚拟机系统常采用过量分配策略,因此造成系统资源的浪费.本文通过分析不同虚拟机的负载特征,提出并实现了一个基于负载特征的虚拟机放置策略.本文利用各种虚拟机负载的互补度,进行多次迭代配对,得到由多台虚拟机组成的配对组,对配对组进行统一分配资源.实验表明,本文提出的方法可将资源利用率较传统方法提高37.5％,较非迭代配对方法提高12.5％.在使用更少的物理机的同时,保持虚拟机性能基本不变.     

基于模糊动态阈值机制的能效虚拟机合并决策方法

动态虚拟机合并是云数据中心改善功耗和资源利用率的有效方法,但负载变化使数据中心较难维持服务等级协议SLA和最优能效.针对该问题,提出一种模糊动态阈值方法对虚拟机合并过程进行决策,在动态负载环境下实现最小化的虚拟机迁移量.该算法利用模糊推理系统动态调整主机资源利用阈值,使得超载主机上的虚拟机迁移大幅降低,并可以满足服务等...     

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

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

云计算环境下基于多目标优化的虚拟机放置研究

云数据中心的规模日益增长导致其产生的能源消耗及成本呈指数级增长.虚拟机的放置是提高云计算环境服务质量与节约成本的核心.针对传统的虚拟机放置算法存在考虑目标单一化和多目标优化难以找到最优解的问题,提出一种面向能耗、资源利用率、负载均衡的多目标优化虚拟机放置模型.通过改进蚁群算法求解优化模型,利用其信息素正反馈机制和启发式...     

基于资源需求分布特征的异构云环境虚拟机放置算法

针对异构云环境中的虚拟机放置（VMP）问题,提出一种基于虚拟机资源需求分布特征的放置算法（RDDFPA）。首先,建立基于CPU资源和内存资源比例系数的虚拟机需求和物理机配置描述方法,并根据该比例系数对所有虚拟机进行排序;其次,通过分析虚拟机需求与物理机配置各自在CPU资源和内存资源比例方面的关系,确定比例分界点,完成虚拟机集合的划分,每个虚拟机子集合的规模反映出对相匹配的不同配置物理机的需求比例;最后,利用启发式算法如首次适应（First Fit）算法完成虚拟机子集合在相匹配配置的物理机子集合上的放置。理论分析和仿真实验结果表明,与采用任意单一配置的物理机总数量相比,所提算法所需物理机的总台数减少了2%~17%。RDDFPA能够根据虚拟机资源需求分布的不同,确定各类配置物理机的数量,高效完成虚拟机的放置,在提高资源利用率的同时,降低了系统能耗。     

改进粒子群算法在云计算负载均衡中的应用研究

云计算系统采用虚拟化技术可以更加灵活和高效地分配运算资源,便于管理员根据用户任务需求按需分配云计算资源。但虚拟化后的云计算中心存在种类多样、数量庞大的虚拟机资源,难以将虚拟机合理地放置到物理主机集群上并达到较好的负载均衡。为此,给出了云计算中心虚拟机放置到物理主机的负载均衡模型,采用改进后的粒子群算法（PSO）来求解最优解。最后通过和常用虚拟机放置算法的仿真对比实验,验证了所提云计算负载均衡优化算法的有效性。     

Performance analysis based resource allocation for green cloud computing

Cloud computing has become a new computing paradigm that has huge potentials in enterprise and business. Green cloud computing is also becoming increasingly important in a world with limited energy resources and an ever-rising demand for more computational power. To maximize utilization and minimize total cost of the cloud computing infrastructure and running applications, resources need to be managed properly and virtual machines shall allocate proper host nodes to perform the computation. In this paper, we propose performance analysis based resource allocation scheme for the efficient allocation of virtual machines on the cloud infrastructure. We experimented the proposed resource allocation algorithm using CloudSim and its performance is compared with two other existing models.     

Resource management framework for collaborative computing systems over multiple virtual machines

A resource management framework for collaborative computing systems over multiple virtual machines (CCSMVM) is presented to increase the performance of computing systems by improving the resource utilization, which has constructed a scalable computing environment for resource on-demand utilization. We design a resource management framework based on the advantages of some components in grid computing platform, virtualized platform and cloud computing platform to reduce computing systems overheads and maintain workloads balancing with the supporting of virtual appliance, Xen API, applications virtualization and so on. The content of collaborate computing, the basis of virtualized resource management and some key technologies including resource planning, resource allocation, resource adjustment and resource release and collaborative computing scheduling are designed in detail. A prototype is designed, and some experiments have verified the correctness and feasibility of our prototype. System evaluations show that the time in resource allocation and resource release is proportional to the quantity of virtual machines, but not the time in the virtual machines migrations. CCSMVM has higher CPU utilization and better performance than other systems, such as Eucalyptus 2.0, Globus4.0, et al. It is concluded that CCSMVM can accelerate the execution of systems by improving average CPU utilization from the results of comparative analysis with other systems, so it is better than others. Our study on resource management framework has some significance to the optimization of the performance in virtual computing systems.     

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

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

基于LP&GR算法的多优先级虚拟机迁移策略研究*

如何对云计算中心的虚拟机(Virtual machine,VM)资源进行合理分配是近年来研究的一个热点问题。针对这一问题,本文提出了一种基于负载预测和灰色关联度(Load Prediction and Gray Relational,LP&GR)的虚拟机资源分配算法,通过预测虚拟机的负载状态防止虚拟机发生过载,并建立了基于虚拟机负载评价函数的决策分配模型。同时为虚拟机的迁移队列设置了多个优先级,结合了抢占式与非抢占式的执行策略,保证了虚拟机的有序迁移,并提高资源利用率。实验结果表明,结合多优先级的LP&GR算法同比其他算法能够有效实现云中心的负载均衡。     

Preemptive cloud resource allocation modeling of processing jobs

Cloud computing allows execution and deployment of different types of applications such as interactive databases or web-based services which require distinctive types of resources. These applications lease cloud resources for a considerably long period and usually occupy various resources to maintain a high quality of service (QoS) factor. On the other hand, general big data batch processing workloads are less QoS-sensitive and require massively parallel cloud resources for short period. Despite the elasticity feature of cloud computing, fine-scale characteristics of cloud-based applications may cause temporal low resource utilization in the cloud computing systems, while process-intensive highly utilized workload suffers from performance issues. Therefore, ability of utilization efficient scheduling of heterogeneous workload is one challenging issue for cloud owners. In this paper, addressing the heterogeneity issue impact on low utilization of cloud computing system, conjunct resource allocation scheme of cloud applications and processing jobs is presented to enhance the cloud utilization. The main idea behind this paper is to apply processing jobs and cloud applications jointly in a preemptive way. However, utilization efficient resource allocation requires exact modeling of workloads. So, first, a novel methodology to model the processing jobs and other cloud applications is proposed. Such jobs are modeled as a collection of parallel and sequential tasks in a Markovian process. This enables us to analyze and calculate the efficient resources required to serve the tasks. The next step makes use of the proposed model to develop a preemptive scheduling algorithm for the processing jobs in order to improve resource utilization and its associated costs in the cloud computing system. Accordingly, a preemption-based resource allocation architecture is proposed to effectively and efficiently utilize the idle reserved resources for the processing jobs in the cloud paradigms. Then, performance metrics such as service time for the processing jobs are investigated. The accuracy of the proposed analytical model and scheduling analysis is verified through simulations and experimental results. The simulation and experimental results also shed light on the achievable QoS level for the preemptively allocated processing jobs.     

基于容器技术的云计算资源自适应管理方法

云计算的发展使得越来越多的软件应用选择云平台作为部署平台。为了应对动态变化的工作负载、应用场景和服务质量目标,应用提供商希望能以一种可伸缩的方式对云计算资源进行动态调整。基于虚拟机的资源管理较为重载,难以实现细粒度的资源动态调整与混合云中跨平台的服务快速迁移。容器技术在一定程度上弥补了虚拟机的不足,然而传统的资源管理方法在诸多方面并不十分适用于容器技术。针对这一问题,提出了基于容器技术的云计算资源自适应管理方法,设计了更适用于容器的资源架构方案与资源之间的调度方式。与传统的线性建模方法不同,所提方法使用非线性函数对云计算资源进行更加精确的建模,同时用遗传算法进行参数调优,使得自适应调整响应更快、总体性能更好。所提方法还针对不同容器多维度的异构性,合理分配容器部署位置,提高物理资源利用率。此外,所提方法结合了容器技术多方面的底层特性,在分配负载等方面进行适应性调整。最后通过实验分析初步确认了所提方法的有效性。     

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.     

Autonomic resource provisioning for multilayer cloud applications with K-nearest neighbor resource scaling and priority-based resource allocation

Providing a pool of various resources and services to customers on the Internet in exchanging money has made cloud computing as one of the most popular technologies. Management of the provided resources and services at the lowest cost and maximum profit is a crucial issue for cloud providers. Thus, cloud providers proceed to auto-scale the computing resources according to the users' requests in order to minimize the operational costs. Therefore, the required time and costs to scale-up and down computing resources are considered as one of the major limits of scaling which has made this issue an important challenge in cloud computing. In this paper, a new approach is proposed based on MAPE-K loop to auto-scale the resources for multilayered cloud applications. K-nearest neighbor (K-NN) algorithm is used to analyze and label virtual machines and statistical methods are used to make scaling decision. In addition, a resource allocation algorithm is proposed to allocate requests on the resources. Results of the simulation revealed that the proposed approach results in operational costs reduction, as well as improving the resource utilization, response time, and profit.