Energy-efficient virtual machine placement in data centers by genetic algorithm

Server consolidation using virtualization technology has become an important technology to improve the energy efficiency of data centers. Virtual machine placement is the key in the server consolidation. In the past few years, many approaches to the virtual machine placement have been proposed. However, existing virtual machine placement approaches to the virtual machine placement problem consider the energy consumption by physical machines in a data center only, but do not consider the energy consumption in communication network in the data center. However, the energy consumption in the communication network in a data center is not trivial, and therefore should be considered in the virtual machine placement in order to make the data center more energy-efficient. In this paper, we propose a genetic algorithm for a new virtual machine placement problem that considers the energy consumption in both the servers and the communication network in the data center. Experimental results show that the genetic algorithm performs well when tackling test problems of different kinds, and scales up well when the problem size increases.

Energy efficient virtual machine placement in data centers

Electricity cost has become a major expense for running data centers and server consolidation using virtualization technology has been used as an important technology to improve the energy efficiency of data centers. In this research, a genetic algorithm and a simulation-annealing algorithm are proposed for the static virtual machine placement problem that considers the energy consumption in both the servers and the communication network, and a trading algorithm is proposed for dynamic virtual machine placement. Experimental results have shown that the proposed methods are more energy efficient than existing solutions.

A hybrid genetic algorithm for the energy-efficient virtual machine placement problem in data centers

Server consolidation using virtualization technology has become an important technology to improve the energy efficiency of data centers. Virtual machine placement is the key in the server consolidation technology. In the past few years, many approaches to the virtual machine placement have been proposed. However, existing virtual machine placement approaches consider the energy consumption by physical machines only, but do not consider the energy consumption in communication network, in a data center. However, the energy consumption in the communication network in a data center is not trivial, and therefore should be considered in the virtual machine placement. In our preliminary research, we have proposed a genetic algorithm for a new virtual machine placement problem that considers the energy consumption in both physical machines and the communication network in a data center. Aiming at improving the performance and efficiency of the genetic algorithm, this paper presents a hybrid genetic algorithm for the energy-efficient virtual machine placement problem. Experimental results show that the hybrid genetic algorithm significantly outperforms the original genetic algorithm, and that the hybrid genetic algorithm is scalable.

An instrument to assess the obesogenic environment of child care centers

OBJECTIVES To describe protocol and interobserver agreements of an instrument to evaluate nutrition and physical activity environments at child care. METHODS Interobserver data were collected from 9 child care centers, through direct observation and document review (17 observer pairs). RESULTS Mean agreement between observer pairs was 87.26% and 79.29% for the observation and document review, respectively. Items with lower agreement were primarily staff behavior, counting across the day/week, and policy classifications. CONCLUSIONS Although some revisions are required, the interobserver agreement for the environment and policy assessment and observation (EPAO instrument) appears to be quite good for assessing the nutrition and physical activity environment of child care centers.

A random key genetic algorithm for live migration of multiple virtual machines in data centers

Live migration of multiple Virtual Machines (VMs) has become an integral management activity in data centers for power saving, load balancing and system maintenance. While state-of-the-art live migration techniques focus on the improvement of migration performance of an independent single VM, only a little has been investigated to the case of live migration of multiple interacting VMs. Live migration is mostly influenced by the network bandwidth and arbitrarily migrating a VM which has data inter-dependencies with other VMs may increase the bandwidth consumption and adversely affect the performances of subsequent migrations. In this paper, we propose a Random Key Genetic Algorithm (RKGA) that efficiently schedules the migration of a given set of VMs accounting both inter-VM dependency and data center communication network. The experimental results show that the RKGA can schedule the migration of multiple VMs with significantly shorter total migration time and total downtime compared to a heuristic algorithm.

Profiling : an application assignment approach for green data centers

In the past few years, there has been a steady increase in the attention, importance and focus of green initiatives related to data centers. While various energy aware measures have been developed for data centers, the requirement of improving the performance efficiency of application assignment at the same time has yet to be fulfilled. For instance, many energy aware measures applied to data centers maintain a trade-off between energy consumption and Quality of Service (QoS). To address this problem, this paper presents a novel concept of profiling to facilitate offline optimization for a deterministic application assignment to virtual machines. Then, a profile-based model is established for obtaining near-optimal allocations of applications to virtual machines with consideration of three major objectives: energy cost, CPU utilization efficiency and application completion time. From this model, a profile-based and scalable matching algorithm is developed to solve the profile-based model. The assignment efficiency of our algorithm is then compared with that of the Hungarian algorithm, which does not scale well though giving the optimal solution.

Community environment education centers : Facilitating community created ecoscapes

This study focuses on designing a community environment education center (CEEC) for Chillingham, as a hub for community transition to sustainability, redressing social fragmentation, youth unemployment, a high eco-footprint and economic rural decline due to globalisation. The ecologically sustainable development framework was delivered by integrating environment education and community development through project-based experiential learning. The development of Chillingham Community Centre involved case study research and incorporated participatory design charrettes, transformative learning, eco-positive development and community-public-private partnerships. This process evolved from community strategic planning in a small rural village buffering world heritage rainforests impacted by a rapidly expanding urban conurbation on Australia’s east coast. This community space encompasses socio-environmental flows connecting people to each other and the ecoscape to grow natural capital, community cohesion and empower eco-governance. Modelling passive solar design, on-site renewable energy/water/nutrient cycling, community garden/market and environment education programs sowed the seeds for a green local economy, demonstrating community capacity to participate in transition to sustainability. A small rural community can demonstrate to other communities that a CEEC enables people to meet their socio-environmental and economic needs locally and sustainably. The ecologically sustainable solution is holistic, all settlements need to be richly biodiverse, locally specific and globally wise.

Using genetic algorithm in profile-based assignment of applications to virtual machines for greener data centers

The increase in data center dependent services has made energy optimization of data centers one of the most exigent challenges in today's Information Age. The necessity of green and energy-efficient measures is very high for reducing carbon footprint and exorbitant energy costs. However, inefficient application management of data centers results in high energy consumption and low resource utilization efficiency. Unfortunately, in most cases, deploying an energy-efficient application management solution inevitably degrades the resource utilization efficiency of the data centers. To address this problem, a Penalty-based Genetic Algorithm (GA) is presented in this paper to solve a defined profile-based application assignment problem whilst maintaining a trade-off between the power consumption performance and resource utilization performance. Case studies show that the penalty-based GA is highly scalable and provides 16% to 32% better solutions than a greedy algorithm.

A penalty-based genetic algorithm for the migration cost-aware virtual machine placement problem in cloud data centers

In the past few years, the virtual machine (VM) placement problem has been studied intensively and many algorithms for the VM placement problem have been proposed. However, those proposed VM placement algorithms have not been widely used in today's cloud data centers as they do not consider the migration cost from current VM placement to the new optimal VM placement. As a result, the gain from optimizing VM placement may be less than the loss of the migration cost from current VM placement to the new VM placement. To address this issue, this paper presents a penalty-based genetic algorithm (GA) for the VM placement problem that considers the migration cost in addition to the energy-consumption of the new VM placement and the total inter-VM traffic flow in the new VM placement. The GA has been implemented and evaluated by experiments, and the experimental results show that the GA outperforms two well known algorithms for the VM placement problem.

A Strength Pareto Evolutionary Algorithm for live migration of multiple interdependent virtual machines in data centers

Although live VM migration has been intensively studied, the problem of live migration of multiple interdependent VMs has hardly been investigated. The most important problem in the live migration of multiple interdependent VMs is how to schedule VM migrations as the schedule will directly affect the total migration time and the total downtime of those VMs. Aiming at minimizing both the total migration time and the total downtime simultaneously, this paper presents a Strength Pareto Evolutionary Algorithm 2 (SPEA2) for the multi-VM migration scheduling problem. The SPEA2 has been evaluated by experiments, and the experimental results show that the SPEA2 can generate a set of VM migration schedules with a shorter total migration time and a shorter total downtime than an existing genetic algorithm, namely Random Key Genetic Algorithm (RKGA). This paper also studies the scalability of the SPEA2.

Art museums and the global tourist: Experience centers in experiencescapes

Art museums are playing an important role is attracting cultural tourists to global cities and regions. Traditionally, art museums were primarily known for their didactic role. In a post-avant-garde era however museums are more focused on appealing to a broader clientele that want art to be novel and entertaining. Art museums have also come to play a greater role in gentrification projects and cultural precincts. This is because they are ideally suited for tourist-centric environments that offer a variety of immersive sensory experiences, and combine museums (often designed by star-architects), international hotels, restaurants, high-end shopping zones, and other leisure platforms. These "experiencescapes" include Port Maravilha urban waterfront development in Rio de Janiero, the Shanghai Bund, and the Broad project in Los Angeles. The Museum of Old and New Art in Hobart Australia is a boutique player in the global market for experiencescapes. It is smaller than many of its competitors and is situated in a remote part of the world, yet it has made an important contribution to Tasmania’s tourism industry.

Phase diagram of vortex matter in layered superconductors with tilted columnar pinning centers

We study the vortex matter phase diagram of a layered superconductor in the presence of columnar pinning defects, tilted with respect to the normal to the layers. We use numerical minimization of the free energy written as a functional of the time-averaged vortex density of the Ramakrishnan-Yussouff form, supplemented by the appropriate pinning potential. We study the case where the pin density is smaller than the areal vortex density. At lower pin concentrations, we find, for temperatures of the order of the melting temperature of the unpinned lattice, a Bose glass type phase which at lower temperatures converts, via a first-order transition, to a Bragg glass, while, at higher temperatures, it crosses over to an interstitial liquid. At somewhat higher concentrations, no transition to a Bragg glass is found even at the lowest temperatures studied. While qualitatively the behavior we find is similar to that obtained using the same procedures for columnar pins normal to the layers, there are important and observable quantitative differences, which we discuss.

Cost-efficient virtual machine management in data centers

Virtual Machine (VM) management is an obvious need in today's data centers for various management activities and is accomplished in two phases— finding an optimal VM placement plan and implementing that placement through live VM migrations. These phases result in two research problems— VM placement problem (VMPP) and VM migration scheduling problem (VMMSP). This research proposes and develops several evolutionary algorithms and heuristic algorithms to address the VMPP and VMMSP. Experimental results show the effectiveness and scalability of the proposed algorithms. Finally, a VM management framework has been proposed and developed to automate the VM management activity in cost-efficient way.

Spherical means with centers on a hyperplane in even dimensions

Given a real-valued function on R-n we study the problem of recovering the function from its spherical means over spheres centered on a hyperplane. An old paper of Bukhgeim and Kardakov derived an inversion formula for the odd n case with great simplicity and economy. We apply their method to derive an inversion formula for the even n case. A feature of our inversion formula, for the even n case, is that it does not require the Fourier transform of the mean values or the use of the Hilbert transform, unlike the previously known inversion formulas for the even n case. Along the way, we extend the isometry identity of Bukhgeim and Kardakov for odd n, for solutions of the wave equation, to the even n case.