Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article

Online strategies for dynamic power management in systems with multiple power-saving states

Published: 01 August 2003 Publication History

Abstract

Online dynamic power management (DPM) strategies refer to strategies that attempt to make power-mode-related decisions based on information available at runtime. In making such decisions, these strategies do not depend upon information of future behavior of the system, or any a priori knowledge of the input characteristics. In this paper, we present online strategies, and evaluate them based on a measure called the competitive ratio that enables a quantitative analysis of the performance of online strategies. All earlier approaches (online or predictive) have been limited to systems with two power-saving states (e.g., idle and shutdown). The only earlier approaches that handled multiple power-saving states were based on stochastic optimization. This paper provides a theoretical basis for the analysis of DPM strategies for systems with multiple power-down states, without resorting to such complex approaches. We show how a relatively simple "online learning" scheme can be used to improve the competitive ratio over deterministic strategies using the notion of "probability-based" online DPM strategies. Experimental results show that the algorithm presented here attains the best competitive ratio in comparison with other known predictive DPM algorithms. The other algorithms that come close to matching its performance in power suffer at least an additional 40% wake-up latency on average. Meanwhile, the algorithms that have comparable latency to our methods use at least 25% more power on average.

References

[1]
Benini, L., Bogliolo, A., and De Micheli, G. 2000. A survey of design techniques for system-level dynamic power management. IEEE Transactions on Very Large Scale Integration (TVLSI) Systems 8, 3, 299--316.
[2]
Benini, L., Bogliolo, A., Paleologo, G., and De Micheli, G. 1999. Policy optimization for dynamic power management. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 18, 6, 813--833.
[3]
Benini, L. and De Micheli, G. 1998. Dynamic Power Management: Design Techniques and CAD Tools. Kluwer Dordrecht.
[4]
Benini, L., De Micheli, G., and Macii, E. 2001. Designing low-power circuits: Practical recipes. IEEE Circuits and Systems Magazine 1, 1 (March), 6--25.
[5]
Borodin, A. and El-Yaniv, R. 1998. Online Computation and Competitive Analysis. Cambridge University Press, Cambridge, MA.
[6]
Chung, E. Y., Benini, L., Bogliolo, A., and De Micheli, G. 1999a. Dynamic power management for non-stationary service requests. In Proceedings of the Design Automation and Test Europe.
[7]
Chung, E.-Y., Benini, L., and De Micheli, G. 1999b. Dynamic power management using adaptive learning trees. In Proceedings of ICCAD.
[8]
Glynn, P., Simunic, T., Benini, L., and De Micheli, G.2000. Dynamic power management of portable systems. In Proceedings of MOBICOM.
[9]
Hwang, C.-H., Allen, C., and Wu, H. 1996. A predictive system shutdown method for energy saving of event-driven computation. In Proceedings of the IEEE/ACM International Conference on Computer Aided Design. 28--32.
[10]
IBM. 1996. Technical Specifications of Hard Drive IBM Travelstar VP 2.5 inch. Available at, http://www.storage.ibm.com/storage/oem/data/travvp.htm.
[11]
Irani, S., Shukla, S., and Gupta, R. 2002. Competitive analysis of dynamic power management strategies for systems with multiple power saving states. In Proceedings of the Design Automation and Test Europe Conference.
[12]
Karlin, A., Manasse, M., McGeoch, L., and Owicki, S. 1990. Randomized competitive algorithms for non-uniform problems. In First Annual ACM-SIAM Symposium on Discrete Algorithms. 301--309.
[13]
Keshav, S., Lund, C., Philliips, S., Reaingold, N., and Saran, H. 1995. An empirical evaluation of virtual circuit holding time policies in ip-over-atm networks. IEEE Journal on Selected Areas in Communications 13, 1371--1382.
[14]
Lu, Y., Chung, E. Y., Simunic, T., Benini, L., and De Micheli, G. 2000. Quantitative comparison of power management algorithms. In DATE---Proceedings of the Design and Automation and Test in Europe Conference and Exhibition.
[15]
Lu, Y. and De Micheli, G. 1999. Adaptive hard disk power management on personal computers. In Proceedings of the Great Lakes Symposium on VLSI.
[16]
Phillips, S. J. and Westbrook, J. R. 1999. On-line algorithms: Competitive analysis and beyond. In Algorithms and Theory of Computation Handbook. CRC Press, Boca Raton, Fl.
[17]
Qiu, Q. and Pedram, M. 1999. Dynamic power management based on continuous-time Markov decision processes. In Proceedings of Design Automation Conference (June) 555--561.
[18]
Qiu, Q., Wu, Q., and Pedram, M. 1999. Stochastic modeling of a power-managed system: Construction and optimization. In Proceedings of the International Symposium on Low Power Electronics and Design.
[19]
Qiu, Q., Wu, Q., and Pedram, M. 2000. Dynamic power management of complex systems using generalized stochastic petri nets. In Proceedings 37th Design Automation Conference (DA'2000) (5--9 June). Los Angeles, CA. 352--356.
[20]
Ramanathan, D. 2000. High-Level Timing and Power Analysis for Embedded Systems. In PhD thesis, University of California at Irvine.
[21]
Ramanathan, D., Irani, S., and Gupta, R. K. 2000. Latency effects of system level power management algorithms. In Proceedings of the IEEE International Conference on Computer-Aided Design.
[22]
Ramanathan, D., Irani, S., and Gupta, R. 2002. An analysis of system level power management algorithms and their effects on latency. IEEE Transactions on Computer Aided Design 21, (March) 3.
[23]
Shukla, S. and Gupta, R. 2001. A model checking approach to evaluating system level power management for embedded systems. In Proceedings of IEEE Workshop on High Level Design Validation and Test (HLDVT01) (November). IEEE Press, New York.
[24]
Simunic, T., Benini, L., and De Micheli, G. 1999. Event driven power management of portable systems. In Proceedings of International Symposium on System Synthesis. 18--23.
[25]
Srivastava, M. B., Chandrakasan, A. P., and Broderson, R. W. 1996. Predictive shutdown and other architectural techniques for energy efficient programmable computation. IEEE Transactions on VLSI Systems 4, 1 (March), 42--54.

Cited By

View all
  • (2023)Online Metric Algorithms with Untrusted PredictionsACM Transactions on Algorithms10.1145/358268919:2(1-34)Online publication date: 15-Apr-2023
  • (2022)Competitive prediction-aware online algorithms for energy generation scheduling in microgridsProceedings of the Thirteenth ACM International Conference on Future Energy Systems10.1145/3538637.3538867(383-394)Online publication date: 28-Jun-2022
  • (2022)Randomized Strategies for Non-additive 3-Slope Ski RentalStructural Information and Communication Complexity10.1007/978-3-031-09993-9_4(62-78)Online publication date: 27-Jun-2022
  • Show More Cited By

Recommendations

Reviews

John P. Dougherty

The popularity and ubiquity of portable computing devices brings the desire for efficiency to the forefront. Dynamic power management (DPM) refers to strategies that determine when to switch the power state of a device on the fly (in this context, switching it to an online status). This paper presents a DPM algorithm that provides a balance of two qualities in conflict: reduced average energy dissipated and reduced average latency. The online probability based algorithm (OPBA) is a variant of a deterministic approach known as the lower envelope algorithm (LEA). OPBA utilizes a so-called sliding window of recent idle period information to continually update the probability of expected idle time. A comparison of LEA, OBPA, and three other predictive approaches (each in preemptive and nonpreemptive implementations) to an optimal offline algorithm (for example, those based on a priori knowledge of idle periods) is conducted. The test data is based on a mobile hard drive with four power states (sleep, standby, idle, active), each with different power consumption, start-up energy, and transition time to active. The results are convincing that OPBA performs very well (refer to Figure 4 in the paper). Furthermore, the paper presents a proof that LEA is 2-competitive (meaning the cost is no worse than twice the optimal), and a thorough analysis of the expected cost for OPBA. The paper is a complete treatment of the proposed algorithms, with appropriate theoretical foundation, reasonable experimental work, and plausible conclusions. The presentation is well organized. A Web site is provided for others to evaluate DPM approaches using the authors' framework, encouraging future work. Online Computing Reviews Service

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Embedded Computing Systems
ACM Transactions on Embedded Computing Systems  Volume 2, Issue 3
August 2003
197 pages
ISSN:1539-9087
EISSN:1558-3465
DOI:10.1145/860176
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Journal Family

Publication History

Published: 01 August 2003
Published in TECS Volume 2, Issue 3

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Dynamic
  2. online algorithms
  3. power management

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)21
  • Downloads (Last 6 weeks)3
Reflects downloads up to 17 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2023)Online Metric Algorithms with Untrusted PredictionsACM Transactions on Algorithms10.1145/358268919:2(1-34)Online publication date: 15-Apr-2023
  • (2022)Competitive prediction-aware online algorithms for energy generation scheduling in microgridsProceedings of the Thirteenth ACM International Conference on Future Energy Systems10.1145/3538637.3538867(383-394)Online publication date: 28-Jun-2022
  • (2022)Randomized Strategies for Non-additive 3-Slope Ski RentalStructural Information and Communication Complexity10.1007/978-3-031-09993-9_4(62-78)Online publication date: 27-Jun-2022
  • (2021)Learning-augmented dynamic power management with multiple states via new ski rental boundsProceedings of the 35th International Conference on Neural Information Processing Systems10.5555/3540261.3541539(16714-16726)Online publication date: 6-Dec-2021
  • (2021)A polynomial-time scheduling approach to minimise idle energy consumption: An application to an industrial furnaceComputers & Operations Research10.1016/j.cor.2020.105167128(105167)Online publication date: Apr-2021
  • (2020)Online metric algorithms with untrusted predictionsProceedings of the 37th International Conference on Machine Learning10.5555/3524938.3524971(345-355)Online publication date: 13-Jul-2020
  • (2020)Bounds for the Multislope Ski-Rental ProblemIEICE Transactions on Information and Systems10.1587/transinf.2019FCP0001E103.D:3(481-488)Online publication date: 1-Mar-2020
  • (2020)EmberProceedings of the 18th Conference on Embedded Networked Sensor Systems10.1145/3384419.3430734(503-516)Online publication date: 16-Nov-2020
  • (2020)Interval Job Scheduling With Machine Launch CostIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2020.300278631:12(2776-2788)Online publication date: 29-Jun-2020
  • (2020)Debugging FPGA-accelerated Real-time Systems2020 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS)10.1109/RTAS48715.2020.00010(350-363)Online publication date: Apr-2020
  • Show More Cited By

View Options

Get Access

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media