57,412 research outputs found
Optimal energy trade-off schedules
International audienceWe consider scheduling tasks that arrive over time on a speed scalable processor. At each time a schedule specifies a job to be run and the speed at which the processor is run. Processors are generally less energy efficient at higher speeds. We seek to understand the structure of schedules that optimally trade-off the energy used by the processor with a common scheduling quality of service measure, fractional weighted delay. We assume that there is some user defined parameter β specifying the user's desired additive trade-off between energy efficiency and quality of service. We prove that the optimal energy trade-off schedule is essentially unique, and has a simple structure. Thus it is easy to check the optimality of a schedule. We further prove that the optimal energy trade-off schedule changes continuously as a function of the parameter β. Thus it is possible to compute the optimal energy trade-off schedule using a natural homotopic optimization algorithm. We further show that multiplicative trade-off schedules have fewer desirable properties
Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules
We give a polynomial time algorithm to compute an optimal energy and fractional weighted flow trade-off schedule for a speed-scalable processor with discrete speeds. Our algorithm uses a geometric approach that is based on structural properties obtained from a primal-dual formulation of the problem
A Multi-objective Perspective for Operator Scheduling using Fine-grained DVS Architecture
The stringent power budget of fine grained power managed digital integrated
circuits have driven chip designers to optimize power at the cost of area and
delay, which were the traditional cost criteria for circuit optimization. The
emerging scenario motivates us to revisit the classical operator scheduling
problem under the availability of DVFS enabled functional units that can
trade-off cycles with power. We study the design space defined due to this
trade-off and present a branch-and-bound(B/B) algorithm to explore this state
space and report the pareto-optimal front with respect to area and power. The
scheduling also aims at maximum resource sharing and is able to attain
sufficient area and power gains for complex benchmarks when timing constraints
are relaxed by sufficient amount. Experimental results show that the algorithm
that operates without any user constraint(area/power) is able to solve the
problem for most available benchmarks, and the use of power budget or area
budget constraints leads to significant performance gain.Comment: 18 pages, 6 figures, International journal of VLSI design &
Communication Systems (VLSICS
Recommended from our members
Locational-based Coupling of Electricity Markets: Benefits from Coordinating Unit Commitment and Balancing Markets
We formulate a series of stochastic models for committing and dispatching electric generators subject to transmission limits. The models are used to estimate the benefits of electricity locational marginal pricing (LMP) that arise from better coordination of day-ahead commitment decisions and real-time balancing markets in adjacent power markets when there is significant uncertainty in demand and wind forecasts. The unit commitment models optimise schedules under either the full set of network constraints or a simplified net transfer capacity (NTC) constraint, considering the range of possible real-time wind and load scenarios. The NTC-constrained model represents the present approach for limiting day-ahead electricity trade in Europe. A subsequent redispatch model then creates feasible real-time schedules. Benefits of LMP arise from decreases in expected start-up and variable generation costs resulting from consistent consideration of the full set of network constraints both day-ahead and in real-time. Meanwhile, using LMP to coordinate adjacent balancing markets provides benefits because it allows intermarket flow schedules to be adjusted in real-time in response to changing conditions. These models are applied to a stylised four-node network, examining the effects of varying system characteristics on the magnitude of the locational-based unit commitment benefits and the benefits of intermarket balancing. Although previous www.eprg.group.cam.ac.uk EPRG WORKING PAPER studies have examined the benefits of LMP, these usually examine one specific system, often without a discussion of the sources of these benefits, and with simplifying assumptions about unit commitment.
We conclude that both categories of benefits are situation dependent, such that small parameter changes can lead to large changes in expected benefits. Although both can amount to a significant percentage of operating costs, we find that the benefits of balancing market coordination are generally larger than the unit commitment benefits
Demand Shaping to Achieve Steady Electricity Consumption with Load Balancing in a Smart Grid
The purpose of this paper is to study conflicting objectives between the grid
operator and consumers in a future smart grid. Traditionally, customers in
electricity grids have different demand profiles and it is generally assumed
that the grid has to match and satisfy the demand profiles of all its users.
However, for system operators and electricity producers, it is usually most
desirable, convenient and cost effective to keep electricity production at a
constant rate. The temporal variability of electricity demand forces power
generators, especially load following and peaking plants to constantly
manipulate electricity production away from a steady operating point
Optimal Quality-of-Service Scheduling for Energy-Harvesting Powered Wireless Communications
XiaojingChen, Wei Ni, Xin Wang, YichuangSun, “Optimal Quality-of-Service Scheduling for Energy-Harvesting Powered Wireless Communications”, IEEE Transactions on Wireless Communications, Vol. 15 (5): 3269-3280, January 2016. © 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.In this paper, a new dynamic string tautening algorithm is proposed to generate the most energy-efficient off-line schedule for delay-limited traffic of transmitters with non-negligible circuit power. The algorithm is based on two key findings that we derive through judicious convex formulation and resultant optimality conditions, specifies a set of simple but optimal rules, and generates the optimal schedule with a low complexity of O(N2) in the worst case. The proposed algorithm is also extended to on-line scenarios, where the transmit schedule is generated on-the-fly. Simulation shows that the proposed algorithm requires substantially lower average complexity by almost two orders of magnitude to retain optimality than general convex solvers. The effective transmit region, specified by the tradeoff of the data arrival rate and the energy harvesting rate, is substantially larger using our algorithm than using other existing alternatives. Significantly more data or less energy can be supported in the proposed algorithm.Peer reviewedFinal Accepted Versio
Integrating labor awareness to energy-efficient production scheduling under real-time electricity pricing : an empirical study
With the penetration of smart grid into factories, energy-efficient production scheduling has emerged as a promising method for industrial demand response. It shifts flexible production loads to lower-priced periods to reduce energy cost for the same production task. However, the existing methods only focus on integrating energy awareness to conventional production scheduling models. They ignore the labor cost which is shift-based and follows an opposite trend of energy cost. For instance, the energy cost is lower during nights while the labor cost is higher. Therefore, this paper proposes a method for energy-efficient and labor-aware production scheduling at the unit process level. This integrated scheduling model is mathematically formulated. Besides the state-based energy model and genetic algorithm-based optimization, a continuous-time shift accumulation heuristic is proposed to synchronize power states and labor shifts. In a case study of a Belgian plastic bottle manufacturer, a set of empirical sensitivity analyses were performed to investigate the impact of energy and labor awareness, as well as the production-related factors that influence the economic performance of a schedule. Furthermore, the demonstration was performed in 9 large-scale test instances, which encompass the cases where energy cost is minor, moderate, and major compared to the joint energy and labor cost. The results have proven that the ignorance of labor in existing energy-efficient production scheduling studies increases the joint energy and labor cost, although the energy cost can be minimized. To achieve effective production cost reduction, energy and labor awareness are recommended to be jointly considered in production scheduling. (C) 2017 Elsevier Ltd. All rights reserved
A multi-objective framework for the optimisation of life-cycle costs of wind turbines
Peer reviewedPublisher PD
- …