PIASA: A power and interference aware resource management strategy for heterogeneous workloads in cloud data centers

Cloud data centers have been progressively adopted in different scenarios, as reflected in the execution of heterogeneous applications with diverse workloads and diverse quality of service (QoS) requirements. Virtual machine (VM) technology eases resource management in physical servers and helps cloud providers achieve goals such as optimization of energy consumption. However, the performance of an application running inside a VM is not guaranteed due to the interference among co-hosted workloads sharing the same physical resources. Moreover, the different types of co-hosted applications with diverse QoS requirements as well as the dynamic behavior of the cloud makes efficient provisioning of resources even more difficult and a challenging problem in cloud data centers. In this paper, we address the problem of resource allocation within a data center that runs different types of application workloads, particularly CPU- and network-intensive applications. To address these challenges, we propose an interference- and power-aware management mechanism that combines a performance deviation estimator and a scheduling algorithm to guide the resource allocation in virtualized environments. We conduct simulations by injecting synthetic workloads whose characteristics follow the last version of the Google Cloud tracelogs. The results indicate that our performance-enforcing strategy is able to fulfill contracted SLAs of real-world environments while reducing energy costs by as much as 21%.

Relay-assisted transmission and radio resource management for wireless networks

The following paper presents an overview of the Ph.D Thesis1 presented in [1], which compiles all the research done during the period of time between 2004-2007. In that dissertation the relay-assisted transmission with half-duplex relays is analyzed from different points of view. This study is motivated by the necessity of finding innovative solutions to cope with the requirements of next generation wireless services, and with current radio technology. The use of relayed communications represents a change of paradigm of conventional communications, and requires the definition and evaluation of protocols to be applied to single or multiple-user relay communication. With the two fold goal of enhancing spectral efficiency and homogenize service in cellular communications, system design is investigated at physical (type of transmissions of the relay, decoding mode, ..) and upper layers (resource allocation, dynamic link control).

Reproductive allocation strategies: a long-term study on proximate factors and temporal adjustments in a viviparous lizard.

Optimisation of reproductive investment is crucial for Darwinian fitness, and detailed long-term studies are especially suited to unravel reproductive allocation strategies. Allocation strategies depend on the timing of resource acquisition, the timing of resource allocation, and trade-offs between different life-history traits. A distinction can be made between capital breeders that fuel reproduction with stored resources and income breeders that use recently acquired resources. In capital breeders, but not in income breeders, energy allocation may be decoupled from energy acquisition. Here, we tested the influence of extrinsic (weather conditions) and intrinsic (female characteristics) factors during energy storage, vitellogenesis and early gestation on reproductive investment, including litter mass, litter size, offspring mass and the litter size and offspring mass trade-off. We used data from a long-term study of the viviparous lizard, Lacerta (Zootoca) vivipara. In terms of extrinsic factors, rainfall during vitellogenesis was positively correlated with litter size and mass, but temperature did not affect reproductive investment. With respect to intrinsic factors, litter size and mass were positively correlated with current body size and postpartum body condition of the previous year, but negatively with parturition date of the previous year. Offspring mass was negatively correlated with litter size, and the strength of this trade-off decreased with the degree of individual variation in resource acquisition, which confirms theoretical predictions. The combined effects of past intrinsic factors and current weather conditions suggest that common lizards combine both recently acquired and stored resources to fuel reproduction. The effect of past energy store points out a trade-off between current and future reproduction.

Resource management research in Passive Optical Networks (PON)

Next Generation Access Networks (NGAN) are the new step forward to deliver broadband services and to facilitate the integration of different technologies. It is plausible to assume that, from a technological standpoint, the Future Internet will be composed of long-range high-speed optical networks; a number of wireless networks at the edge; and, in between, several access technologies, among which, the Passive Optical Networks (xPON) are very likely to succeed, due to their simplicity, low-cost, and increased bandwidth. Among the different PON technologies, the Ethernet-PON (EPON) is the most promising alternative to satisfy operator and user needs, due to its cost, flexibility and interoperability with other technologies. One of the most interesting challenges in such technologies relates to the scheduling and allocation of resources in the upstream (shared) channel. The aim of this research project is to study and evaluate current contributions and propose new efficient solutions to address the resource allocation issues in Next Generation EPON (NG-EPON). Key issues in this context are future end-user needs, integrated quality of service (QoS) support and optimized service provisioning for real time and elastic flows. This project will unveil research opportunities, issue recommendations and propose novel mechanisms associated with the convergence within heterogeneous access networks and will thus serve as a basis for long-term research projects in this direction. The project has served as a platform for the generation of new concepts and solutions that were published in national and international conferences, scientific journals and also in book chapter. We expect some more research publications in addition to the ones mentioned to be generated in a few months.

Radial measures of public services deficit for regional allocation of public funds

The goal of this paper is to present an optimal resource allocation model for the regional allocation of public service inputs. Theproposed solution leads to maximise the relative public service availability in regions located below the best availability frontier, subject to exogenous budget restrictions and equality ofaccess for equal need criteria (equity-based notion of regional needs). The construction of non-parametric deficit indicators is proposed for public service availability by a novel application of Data Envelopment Analysis (DEA) models, whose results offer advantages for the evaluation and improvement of decentralised public resource allocation systems. The method introduced in this paper has relevance as a resource allocation guide for the majority of services centrally funded by the public sector in a given country, such as health care, basic and higher education, citizen safety, justice, transportation, environmental protection, leisure, culture, housing and city planning, etc.

Transplantation hépatique : introduction en Suisse d'un nouveau système d'allocation des organes [Liver transplantation: new organ allocation system in Switzerland]

This article describes the new organ allocation system for liver transplantation introduced in Switzerland on July 1, 2007. In its newly adopted transplantation law, Switzerland chose the MELD score (Model for end-stage liver disease), based on three laboratory values: total bilirubin, serum creatinine and INR. Advantages and limitations of the MELD score are discussed. Finally the West Switzerland joint liver transplantation program is briefly introduced. Cet article décrit le nouveau système d'allocation des organes pour la transplantation hépatique, qui a été introduit en Suisse depuis le 1er juillet 2007. En se dotant d'une nouvelle loi sur la transplantation en 2007, la Suisse a en effet opté pour le score MELD (Model for end-stage liver disease), c'est-à-dire un score calculable à partir de trois valeurs de laboratoire : bilirubine totale, créatinine et INR. Les avantages du MELD, mais aussi quelques inconvénients potentiels, sont brièvement décrits. Afin de clarifier le parcours du patient pour lequel une évaluation prétransplantation hépatique spécialisée est indiquée, une brève description du programme romand de transplantation hépatique est présentée.

Dynamic models of energy allocation and investment

In dynamic models of energy allocation, assimilated energy is allocated to reproduction, somatic growth, maintenance or storage, and the allocation pattern can change with age. The expected evolutionary outcome is an optimal allocation pattern, but this depends on the environment experienced during the evolutionary process and on the fitness costs and benefits incurred by allocating resources in different ways. Here we review existing treatments which encompass some of the possibilities as regards constant or variable environments and their predictability or unpredictability, and the ways in which production rates and mortality rates depend on body size and composition and age and on the pattern of energy allocation. The optimal policy is to allocate resources where selection pressures are highest, and simultaneous allocation to several body subsystems and reproduction can be optimal if these pressures are equal. This may explain balanced growth commonly observed during ontogeny. Growth ceases at maturity in many models; factors favouring growth after maturity include non-linear trade-offs, variable season length, and production and mortality rates both increasing (or decreasing) functions of body size. We cannot yet say whether these are sufficient to account for the many known cases of growth after maturity and not all reasonable models have yet been explored. Factors favouring storage are also reviewed.

Algorithmic Solutions for Combinatorial Problems in Resource Management of Manufacturing Environments

This thesis studies the use of heuristic algorithms in a number of combinatorial problems that occur in various resource constrained environments. Such problems occur, for example, in manufacturing, where a restricted number of resources (tools, machines, feeder slots) are needed to perform some operations. Many of these problems turn out to be computationally intractable, and heuristic algorithms are used to provide efficient, yet sub-optimal solutions. The main goal of the present study is to build upon existing methods to create new heuristics that provide improved solutions for some of these problems. All of these problems occur in practice, and one of the motivations of our study was the request for improvements from industrial sources. We approach three different resource constrained problems. The first is the tool switching and loading problem, and occurs especially in the assembly of printed circuit boards. This problem has to be solved when an efficient, yet small primary storage is used to access resources (tools) from a less efficient (but unlimited) secondary storage area. We study various forms of the problem and provide improved heuristics for its solution. Second, the nozzle assignment problem is concerned with selecting a suitable set of vacuum nozzles for the arms of a robotic assembly machine. It turns out that this is a specialized formulation of the MINMAX resource allocation formulation of the apportionment problem and it can be solved efficiently and optimally. We construct an exact algorithm specialized for the nozzle selection and provide a proof of its optimality. Third, the problem of feeder assignment and component tape construction occurs when electronic components are inserted and certain component types cause tape movement delays that can significantly impact the efficiency of printed circuit board assembly. Here, careful selection of component slots in the feeder improves the tape movement speed. We provide a formal proof that this problem is of the same complexity as the turnpike problem (a well studied geometric optimization problem), and provide a heuristic algorithm for this problem.

Minimal cross-subsidies approach for loss allocation in distribution networks with open access

Open access philosophy applied by regulatory agencies may lead to a scenario where captive consumers will solely face the responsibility on distribution network's losses even with Independent Energy Producers (also known as Distributed Generation) and Independent Energy Consumers connected to the system. This work proposes the utilization of a loss allocation method in distribution systems where open access is allowed, in which cross-subsidies, that appear due to the influence the generators have over the system losses, are minimized. Thus, guaranteeing to some extent the efficiency and transparency of the economic signals of the market. Results obtained through the Zbus loss allocation method adapted for distribution networks are processed in such a way that the corresponding allocation to the generation buses is divided among the consumer buses, while still considering consumers spatial characteristics. © 2007 IEEE.

Constraint based methods for allocation and scheduling of periodic applications

This work presents exact algorithms for the Resource Allocation and Cyclic Scheduling Problems (RA&CSPs). Cyclic Scheduling Problems arise in a number of application areas, such as in hoist scheduling, mass production, compiler design (implementing scheduling loops on parallel architectures), software pipelining, and in embedded system design. The RA&CS problem concerns time and resource assignment to a set of activities, to be indefinitely repeated, subject to precedence and resource capacity constraints. In this work we present two constraint programming frameworks facing two different types of cyclic problems. In first instance, we consider the disjunctive RA&CSP, where the allocation problem considers unary resources. Instances are described through the Synchronous Data-flow (SDF) Model of Computation. The key problem of finding a maximum-throughput allocation and scheduling of Synchronous Data-Flow graphs onto a multi-core architecture is NP-hard and has been traditionally solved by means of heuristic (incomplete) algorithms. We propose an exact (complete) algorithm for the computation of a maximum-throughput mapping of applications specified as SDFG onto multi-core architectures. Results show that the approach can handle realistic instances in terms of size and complexity. Next, we tackle the Cyclic Resource-Constrained Scheduling Problem (i.e. CRCSP). We propose a Constraint Programming approach based on modular arithmetic: in particular, we introduce a modular precedence constraint and a global cumulative constraint along with their filtering algorithms. Many traditional approaches to cyclic scheduling operate by fixing the period value and then solving a linear problem in a generate-and-test fashion. Conversely, our technique is based on a non-linear model and tackles the problem as a whole: the period value is inferred from the scheduling decisions. The proposed approaches have been tested on a number of non-trivial synthetic instances and on a set of realistic industrial instances achieving good results on practical size problem.

Resource management in location aware cognitive radio networks

Dynamic spectrum access (DSA) aims at utilizing spectral opportunities both in time and frequency domains at any given location, which arise due to variations in spectrum usage. Recently, Cognitive radios (CRs) have been proposed as a means of implementing DSA. In this work we focus on the aspect of resource management in overlaid CRNs. We formulate resource allocation strategies for cognitive radio networks (CRNs) as mathematical optimization problems. Specifically, we focus on two key problems in resource management: Sum Rate Maximization and Maximization of Number of Admitted Users. Since both the above mentioned problems are NP hard due to presence of binary assignment variables, we propose novel graph based algorithms to optimally solve these problems. Further, we analyze the impact of location awareness on network performance of CRNs by considering three cases: Full location Aware, Partial location Aware and Non location Aware. Our results clearly show that location awareness has significant impact on performance of overlaid CRNs and leads to increase in spectrum utilization effciency.

Drought Stress alters Solute Allocation in Broadleaf Dock (Rumex obtusifolius)

According to climate models, drier summers must be expected more frequently in Central Europe during the next decades, which may influence plant performance and competition in grassland. The overall source–sink relations in plants, especially allocation of solutes to above- and below-ground parts, may be affected by drought. To investigate solute export from a given leaf of broadleaf dock, a solution containing 57Co and 65Zn was introduced through a leaf flap. The export from this leaf was detected by analysing radionuclide contents in various plant parts. Less label was allocated to new leaves and more to roots under drought. The observed alterations of source–sink relations in broadleaf dock were reversible during a subsequent short period of rewatering. These findings suggest an increased resource allocation to roots under drought improving the functionality of the plants.

I shouldn't have to do this: Illegitimate tasks as a stressor in relation to organizational control and resource deficits

The performance of tasks that are perceived as unnecessary or unreasonable, illegitimate tasks, represents a new stressor concept that refers to assignments that violate the norms associated with the role requirements of professional work. Research has shown that illegitimate tasks are associated with stress and counterproductive work behaviour. The purpose of this study was to provide insight into the contribution of characteristics of the organization on the prevalence of illegitimate tasks in the work of frontline and middle managers. Using the Bern Illegitimate Task Scale (BITS) in a sample of 440 local government operations managers in 28 different organizations in Sweden, this study supports the theoretical assumptions that illegitimate tasks are positively related to stress and negatively related to satisfaction with work performance. Results further show that 10% of the variance in illegitimate tasks can be attributed to the organization where the managers work. Multilevel referential analysis showed that the more the organization was characterized by competition for resources between units, unfair and arbitrary resource allocation and obscure decisional structure, the more illegitimate tasks managers reported. These results should be valuable for strategic-level management since they indicate that illegitimate tasks can be counteracted by means of the organization of work.

Resource-Constrained Project Scheduling with Project Management Information Systems

Most commercial project management software packages include planning methods to devise schedules for resource-constrained projects. As it is proprietary information of the software vendors which planning methods are implemented, the question arises how the software packages differ in quality with respect to their resource-allocation capabilities. We experimentally evaluate the resource-allocation capabilities of eight recent software packages by using 1,560 instances with 30, 60, and 120 activities of the well-known PSPLIB library. In some of the analyzed packages, the user may influence the resource allocation by means of multi-level priority rules, whereas in other packages, only few options can be chosen. We study the impact of various complexity parameters and priority rules on the project duration obtained by the software packages. The results indicate that the resource-allocation capabilities of these packages differ significantly. In general, the relative gap between the packages gets larger with increasing resource scarcity and with increasing number of activities. Moreover, the selection of the priority rule has a considerable impact on the project duration. Surprisingly, when selecting a priority rule in the packages where it is possible, both the mean and the variance of the project duration are in general worse than for the packages which do not offer the selection of a priority rule.

The Resource-Constrained Project Scheduling Problem with Work-Content Constraints

For executing the activities of a project, one or several resources are required, which are in general scarce. Many resource-allocation methods assume that the usage of these resources by an activity is constant during execution; in practice, however, the project manager may vary resource usage by individual activities over time within prescribed bounds. This variation gives rise to the project scheduling problem which consists in allocating the scarce resources to the project activities over time such that the project duration is minimized, the total number of resource units allocated equals the prescribed work content of each activity, and precedence and various work-content-related constraints are met.