Supply and Demand Coordination in Energy Adaptive Computing
Author:
- Krishna KantKKKrishna Kant
- 1 August 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10952055,p. 1-6
Abstract
The increasing power consumption of computing infrastructure and power density in computing devices is becoming a major concern from a variety of perspectives ranging from Moore's Law scaling to sustainability. Addressing these concerns results in designs that are much leaner in terms of their energy, power and thermal capabilities, and thus require much smarter control to stay within the provided budgets. This leads to the notion of energy adaptive computing where the power management needs to go well beyond energy efficiency and handle situations of insufficient energy via a variety of adaptation techniques. In this paper we address the problem of simultaneous power demand and supply regulation for multilevel systems such as data centers. We expose challenges in such controls and examine the performance of a simple control scheme designed to provide a stable control via demand migrations.Keywords
This publication has 13 references indexed in Scilit:
- Distributed Energy Adaptive Computing2010
- Temperature-constrained power control for chip multiprocessors with online model estimation2009
- Lifetime exergy consumption as a sustainability metric for information technologies2009
- A framework for dynamic adaptation of power-aware server clusters2009
- An Analysis of Efficient Multi-Core Global Power Management Policies: Maximizing Performance for a Given Power Budget40th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO 2007), 2006
- Ensemble-level Power Management for Dense Blade Servers2006
- Task-based adaptation for ubiquitous computingIEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews), 2006
- Managing battery lifetime with energy-aware adaptationACM Transactions on Computer Systems, 2004
- Characterization of E-Commerce TrafficElectronic Commerce Research, 2003
- Worst-Case Performance Bounds for Simple One-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1974