Energy-aware Load Balancing Policies for the Cloud Ecosystem

The energy consumption of computer and communication systems does not scale linearly with the workload. A system uses a significant amount of energy even when idle or lightly loaded. A widely reported solution to resource management in large data centers is to concentrate the load on a subset of servers and, whenever possible, switch the rest of the servers to one of the possible sleep states. We propose a reformulation of the traditional concept of load balancing aiming to optimize the energy consumption of a large-scale system: {\it distribute the workload evenly to the smallest set of servers operating at an optimal energy level, while observing QoS constraints, such as the response time.} Our model applies to clustered systems; the model also requires that the demand for system resources to increase at a bounded rate in each reallocation interval. In this paper we report the VM migration costs for application scaling.Comment: 10 Page

Analysis of Dynamic Task Allocation in Multi-Robot Systems

Dynamic task allocation is an essential requirement for multi-robot systems operating in unknown dynamic environments. It allows robots to change their behavior in response to environmental changes or actions of other robots in order to improve overall system performance. Emergent coordination algorithms for task allocation that use only local sensing and no direct communication between robots are attractive because they are robust and scalable. However, a lack of formal analysis tools makes emergent coordination algorithms difficult to design. In this paper we present a mathematical model of a general dynamic task allocation mechanism. Robots using this mechanism have to choose between two types of task, and the goal is to achieve a desired task division in the absence of explicit communication and global knowledge. Robots estimate the state of the environment from repeated local observations and decide which task to choose based on these observations. We model the robots and observations as stochastic processes and study the dynamics of the collective behavior. Specifically, we analyze the effect that the number of observations and the choice of the decision function have on the performance of the system. The mathematical models are validated in a multi-robot multi-foraging scenario. The model's predictions agree very closely with experimental results from sensor-based simulations.Comment: Preprint version of the paper published in International Journal of Robotics, March 2006, Volume 25, pp. 225-24

Colour reverse learning and animal personalities: the advantage of behavioural diversity assessed with agent-based simulations

Foraging bees use colour cues to help identify rewarding from unrewarding flowers, but as conditions change, bees may require behavioural flexibility to reverse their learnt preferences. Perceptually similar colours are learnt slowly by honeybees and thus potentially pose a difficult task to reverse-learn. Free-flying honeybees (N = 32) were trained to learn a fine colour discrimination task that could be resolved at ca. 70% accuracy following extended differential conditioning, and were then tested for their ability to reverse-learn this visual problem multiple times. Subsequent analyses identified three different strategies: ‘Deliberative-decisive’ bees that could, after several flower visits, decisively make a large change to learnt preferences; ‘Fickle- circumspect’ bees that changed their preferences by a small amount every time they encountered evidence in their environment; and ‘Stay’ bees that did not change from their initially learnt preference. The next aim was to determine if there was any advantage to a colony in maintaining bees with a variety of decision-making strategies. To understand the potential benefits of the observed behavioural diversity agent-based computer simulations were conducted by systematically varying parameters for flower reward switch oscillation frequency, flower handling time, and fraction of defective ‘target’ stimuli. These simulations revealed that when there is a relatively high frequency of reward reversals, fickle-circumspect bees are more efficient at nectar collection. However, as the reward reversal frequency decreases the performance of deliberative-decisive bees becomes most efficient. These findings show there to be an evolutionary benefit for honeybee colonies with individuals exhibiting these different strategies for managing resource change. The strategies have similarities to some complex decision-making processes observed in humans, and algorithms implemented in artificial intelligence systems

Modeling and visualizing networked multi-core embedded software energy consumption

In this report we present a network-level multi-core energy model and a software development process workflow that allows software developers to estimate the energy consumption of multi-core embedded programs. This work focuses on a high performance, cache-less and timing predictable embedded processor architecture, XS1. Prior modelling work is improved to increase accuracy, then extended to be parametric with respect to voltage and frequency scaling (VFS) and then integrated into a larger scale model of a network of interconnected cores. The modelling is supported by enhancements to an open source instruction set simulator to provide the first network timing aware simulations of the target architecture. Simulation based modelling techniques are combined with methods of results presentation to demonstrate how such work can be integrated into a software developer's workflow, enabling the developer to make informed, energy aware coding decisions. A set of single-, multi-threaded and multi-core benchmarks are used to exercise and evaluate the models and provide use case examples for how results can be presented and interpreted. The models all yield accuracy within an average +/-5 % error margin

Self-organising agent communities for autonomic resource management

The autonomic computing paradigm addresses the operational challenges presented by increasingly complex software systems by proposing that they be composed of many autonomous components, each responsible for the run-time reconfiguration of its own dedicated hardware and software components. Consequently, regulation of the whole software system becomes an emergent property of local adaptation and learning carried out by these autonomous system elements. Designing appropriate local adaptation policies for the components of such systems remains a major challenge. This is particularly true where the system’s scale and dynamism compromise the efficiency of a central executive and/or prevent components from pooling information to achieve a shared, accurate evidence base for their negotiations and decisions.In this paper, we investigate how a self-regulatory system response may arise spontaneously from local interactions between autonomic system elements tasked with adaptively consuming/providing computational resources or services when the demand for such resources is continually changing. We demonstrate that system performance is not maximised when all system components are able to freely share information with one another. Rather, maximum efficiency is achieved when individual components have only limited knowledge of their peers. Under these conditions, the system self-organises into appropriate community structures. By maintaining information flow at the level of communities, the system is able to remain stable enough to efficiently satisfy service demand in resource-limited environments, and thus minimise any unnecessary reconfiguration whilst remaining sufficiently adaptive to be able to reconfigure when service demand changes

A micro-econometric approach to geographic market definition in local retail markets: demand side considerations

This paper formalizes an empirically implementable framework for the definition of local antitrust markets in retail markets. This framework rests on a demand model that captures the trade-off between distance and pecuniary cost across alternative shopping destinations within local markets. The paper develops, and presents estimation results for, an empirical demand model at the store level for groceries in the UK