A simulated annealing algorithm for energy efficient virtual machine placement

Improving energy efficiency has become increasingly important in data centers in recent years to reduce the rapidly growing tremendous amounts of electricity consumption. The power dissipation of the physical servers is the root cause of power usage of other systems, such as cooling systems. Many efforts have been made to make data centers more energy efficient. One of them is to minimize the total power consumption of these servers in a data center through virtual machine consolidation, which is implemented by virtual machine placement. The placement problem is often modeled as a bin packing problem. Due to the NP-hard nature of the problem, heuristic solutions such as First Fit and Best Fit algorithms have been often used and have generally good results. However, their performance leaves room for further improvement. In this paper we propose a Simulated Annealing based algorithm, which aims at further improvement from any feasible placement. This is the first published attempt of using SA to solve the VM placement problem to optimize the power consumption. Experimental results show that this SA algorithm can generate better results, saving up to 25 percentage more energy than First Fit Decreasing in an acceptable time frame.

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.

Licensed to sell : product placement in the James Bond film series

As one of the longest running franchises in cinema history, and with its well-established use of product placements, the James Bond film series provides an ideal framework within which to measure and catalogue the number and types of products used within a particular timeframe. This case study will draw upon extensive content analysis of the James Bond film series in order to chart the evolution of product placement across the franchise's 50 year history.

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.

Placement Trajectory : mapping the journeys of children and young people in out-of-home care

Significant problems confront our child protection out-of-home care system including: high costs; increasing numbers of children and young people entering and remaining in care longer; high frequency of placement movement; and, negative whole-of-life outcomes for children and young people who have exited care. National policy and research agendas recognise the importance of enhancing the evidence base in out-of-home care to inform the development of policy, programs and practice, and improve longitudinal outcomes of children and young people. The authors discuss the concept of placement trajectory as a framework for research and systems analysis in the out-of-home context. While not without limitations, the concept of placement trajectory is particularly useful in understanding the factors influencing placement movement and stability. Increasing the evidence base in this area can serve to enhance improved outcomes across the lifespan for children and young people in the out-of-home care system.

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.

Optimal distributed generation placement in radial distribution systems

Distributed generation (DG) resources are commonly used in the electric systems to obtain minimum line losses, as one of the benefits of DG, in radial distribution systems. Studies have shown the importance of appropriate selection of location and size of DGs. This paper proposes an analytical method for solving optimal distributed generation placement (ODGP) problem to minimize line losses in radial distribution systems using loss sensitivity factor (LSF) based on bus-injection to branch-current (BIBC) matrix. The proposed method is formulated and tested on 12 and 34 bus radial distribution systems. The classical grid search algorithm based on successive load flows is employed to validate the results. The main advantages of the proposed method as compared with the other conventional methods are the robustness and no need to calculate and invert large admittance or Jacobian matrices. Therefore, the simulation time and the amount of computer memory, required for processing data especially for the large systems, decreases.

Accurate placement of a pelvic binder improves reduction of unstable fractures of the pelvic ring

The aim of this study was to assess the accuracy of placement of pelvic binders and to determine whether circumferential compression at the level of the greater trochanters is the best method of reducing a symphyseal diastasis. Patients were identified by a retrospective review of all pelvic radiographs performed at a military hospital over a period of 30 months. We analysed any pelvic radiograph on which the buckle of the pelvic binder was clearly visible. The patients were divided into groups according to the position of the buckle in relation to the greater trochanters: high, trochanteric or low. Reduction of the symphyseal diastasis was measured in a subgroup of patients with an open-book fracture, which consisted of an injury to the symphysis and disruption of the posterior pelvic arch (AO/OTA 61-B/C). We identified 172 radiographs with a visible pelvic binder. Five cases were excluded due to inadequate radiographs. In 83 (50%) the binder was positioned at the level of the greater trochanters. A high position was the most common site of inaccurate placement, occurring in 65 (39%). Seventeen patients were identified as a subgroup to assess the effect of the position of the binder on reduction of the diastasis. The mean gap was 2.8 times greater (mean difference 22 mm) in the high group compared with the trochanteric group (p < 0.01). Application of a pelvic binder above the level of the greater trochanters is common and is an inadequate method of reducing pelvic fractures and is likely to delay cardiovascular recovery in these seriously injured patients.

A more efficient and effective heuristic algorithm for the MapReduce placement problem in cloud computing

The placement of the mappers and reducers on the machines directly affects the performance and cost of the MapReduce computation in cloud computing. From the computational point of view, the mappers/reducers placement problem is a generalization of the classical bin packing problem, which is NP-complete. Thus, in this paper we propose a new heuristic algorithm for the mappers/reducers placement problem in cloud computing and evaluate it by comparing with other several heuristics on solution quality and computation time by solving a set of test problems with various characteristics. The computational results show that our heuristic algorithm is much more efficient than the other heuristics. Also, we verify the effectiveness of our heuristic algorithm by comparing the mapper/reducer placement for a benchmark problem generated by our heuristic algorithm with a conventional mapper/reducer placement. The comparison results show that the computation using our mapper/reducer placement is much cheaper while still satisfying the computation deadline.

A new grouping genetic algorithm for the MapReduce placement problem in cloud computing

MapReduce is a computation model for processing large data sets in parallel on large clusters of machines, in a reliable, fault-tolerant manner. A MapReduce computation is broken down into a number of map tasks and reduce tasks, which are performed by so called mappers and reducers, respectively. The placement of the mappers and reducers on the machines directly affects the performance and cost of the MapReduce computation. From the computational point of view, the mappers/reducers placement problem is a generation of the classical bin packing problem, which is NPcomplete. Thus, in this paper we propose a new grouping genetic algorithm for the mappers/reducers placement problem in cloud computing. Compared with the original one, our grouping genetic algorithm uses an innovative coding scheme and also eliminates the inversion operator which is an essential operator in the original grouping genetic algorithm. The new grouping genetic algorithm is evaluated by experiments and the experimental results show that it is much more efficient than four popular algorithms for the problem, including the original grouping genetic algorithm.

Accelerometer validity and placement for detection of changes in physical activity in dogs under controlled conditions on a treadmill

The objective of the research was to determine the optimal location and method of attachment for accelerometer-based motion sensors, and to validate their ability to differentiate rest and increases in speed in healthy dogs moving on a treadmill. Two accelerometers were placed on a harness between the scapulae of dogs with one in a pouch and one directly attached to the harness. Two additional accelerometers were placed (pouched and not pouched) ventrally on the dog's collar. Data were recorded in 1. s epochs with dogs moving in stages lasting 3. min each on a treadmill: (1) at rest, lateral recumbency, (2) treadmill at 0% slope, 3. km/h, (3) treadmill at 0% slope, 5. km/h, (4) treadmill at 0% slope, 7. km/h, (5) treadmill at 5% slope, 5. km/h, and; (6) treadmill at 5% slope, 7. km/h. Only the harness with the accelerometer in a pouch along the dorsal midline yielded statistically significant increases (P< 0.05) in vector magnitude as walking speed of the dogs increased (5-7. km/h) while on the treadmill. Statistically significant increases in vector magnitude were detected in the dogs as the walking speed increased from 5 to 7. km/h, however, changes in vector magnitude were not detected when activity intensity was increased as a result of walking up a 5% grade. Accelerometers are a valid and objective tool able to discriminate between and monitor different levels of activity in dogs in terms of speed of movement but not in energy expenditure that occurs with movement up hill.

The special branch : governing mentalities through alternative-site placement

"…one should try to locate power at the extreme points of its exercise, where it is always less legal in character." (Foucault, 1980, p.97) Studies of schooling practices as techniques deriving from a particular art of governing that Foucault (2003b) called ‘governmentality’ have shown how psychopathologising discourses work to construct particular student-subjects and legitimise various practices of exclusion (Gram, 2007b). Here I extend this work to consider the use of alternative-site placement as an intensification in response to governmentality being put ‘at risk’. Governing ‘at a distance’ conjures an illusion of individual freedom which relies on the production of subjects who ‘choose’ to make choices that are consistent with the aspirations of government. In this chapter, it is argued that the designation of a child as ‘disorderly’ legitimises the intrusion of state into the private domain of the family via the Trojan horse of early intervention. This is enabled by the psy-sciences, whose technologies and aims amount to the moral retraining of ‘improper’ future-citizens who, in choosing to choose otherwise, threaten to make visible invisible relations of power. Alternative-site placement in special schools running intensive behaviour modification programs allows for a ‘redoubled insistence’ (Ewald, 1992) of these norms and limits that a ‘disorderly’ child threatens to transgress.