Cardosa have investigated the problem of the power-efficient VM 
allocation in virtualized enterprise computing environments. Pizza Express vouchers They leverage min, max, and shares parameters, which are supported by the most modern VM man- agers. Min and max allow the user to specify minimum and maximum of CPU time that can be allocated to a VM. Shares parameter determines proportions, in which CPU time will be allocated to VMs sharing the same resource. Such approach suits only enterprise environments, as it does not support strictSLAand requires the knowledge of the application priorities.
The authors have provided a mathematical formulation of the optimization problem. Essay writing service The objective function to be optimized includes the power consumption and utility gained from the execution of a VM, which is assumed to be known a priori. The authors provide several heuristics for the defined model and experi- mental results. A basic strategy is to place all the VMs at their maximum resource requirements in a first-fit manner and leave 10% of the spare capacity to handle the future growth of the resource usage. The algorithm leverages the heterogeneity of the infrastructure by sorting
ergohuman physical machines in the increasing order
win ipad 2 of the power cost per unit of capacity. The limitations of the basic strategy are that it does not leverage relative priorities of different VMs, it always allocates a VM at its maxi- mum resource requirements, and uses only 90% of a server’s capacity. This algo- rithm has been used as the benchmark policy and improved throughout the paper eventually culminating in the recommended PowerExpandMinMax algorithm. In comparison to the basic policy, this algorithm uses the value of profit that can be gained by allocating an amount of resource to a particular VM. It leverages the ability to shrink a VM to minimum resource requirements digital signage when necessary and expand it when it is allowed by the spare capacity and can bring additional profit. The power consumption cost incurred by each physical server is deducted from the profit to limit the number of servers in use.
The authors have Data Mining Software evaluated the proposed algorithms on a range of large-scale
simulations and a small real data center testbed. The experimental results show that the PowerExpandMinMax algorithm consistently outperforms the other policies across a broad spectrum of inputs—varying VM sizes and utilities, varying server capacities, and varying power costs. One of the experiments on a real testbed showed that the overall utility of the data center can be improved by 47%. A limitation of this work is that migration of VMs is not applied in order to adapt the allocation of VMs at run-time—the allocation is static. Another problem is that no other system resources except for CPU are handled by the model. Moreover, the approach requires static definition of the application priorities that limits the
applicability in real-world environments.
pMapper: Power and Migration Cost
Aware Application Placement
Verm have investigated the problem of dynamic placement of applications in virtualized systems, while minimizing the power consumption and main- taining theSLA. To address the problem, the authors have proposed the pMapper application placement framework. It consists of three managers and an arbitrator, which coordinates their actions and makes allocation decisions. Performance Man- ager monitors the applications’ behavior and resizes VMs according to current resource requirements and theSLA. Power Manager is in charge of adjusting hardware power states and applying DVFS. Migration Manager issues instructions for live migration of VMs in order to consolidate the workload. Arbitrator has a global view of the system and makes decisions about new placements of VMs and determines which VMs and which nodes should be migrated to achieve this place- ment. The authors claim that the proposed framework is general enough to be able to incorporate different power and performance management strategies underSLAconstraints.
The authors have formulated the problem as a continuous optimization: at each time frame, the VM placement should be optimized to minimize the power con- sumption and maximize the performance. They make several assumptions to solve the problem, which are justified by experimental studies. The first of them is the performance isolation, which means that a VM can be seen by an application running on that VM as a dedicated physical server with the characteristics equal to the VM parameters. The second assumption is that the duration of a VM live migration does not depend on the background load, and the cost of migration can be estimated based on the VM size and profit decrease caused by anSLAviolation. The moreover, the solution does not focus on specific applications and can be
applied to any kind of the workload. Another assumption is that the power minimization algorithm can minimize the power consumption without knowing the actual amount of power consumed by the application.
The authors have presented several algorithms to solve the defined problem. They have defined it as a bin packing problem with variable bin sizes and costs. The bins, items to pack, and bin costs represent servers, VMs, and power consumption of servers, respectively. To solve the bin packing problem, first-fit decreasing algorithm (FFD) has been adapted to work for differently sized bins with item-dependent cost functions. The problem has been divided into two subproblems: in the first part, new utilization values are determined for each server based on the cost functions and required performance; in the second part, the applications are placed onto servers to fill the target utilization. This algorithm is called min Power Packing (mPP). The first phase of mPP solves the cost minimization problem, whereas the second phase solves the application placement problem. mPP has been adapted to reduce the migration cost by keeping track of the previous placement while solving the second phase. This variant is termed mPPH. Finally, the placement algorithm has been designed that optimizes the power and migration cost trade-off (pMaP). A VM is chosen to be migrated only if the revenue due to the new placement exceeds the migration cost. pMap searches the space between the old and new placements and finds a placement that minimizes the overall cost (sum of the power and migration costs). The authors have implemented the pMapper architecture with the proposed algorithms and per- formed extensive experiments to validate the efficiency of the approach. The experi- mental results show that the approach allows saving about 25% of power relatively to the Static and Load Balanced Placement algorithms. The researchers have suggested several directions for the future work such as the consideration of memory bandwidth, a more advanced application of idle states, and an extension of the theoretical
formulation of the problem.