Bounds on power savings using runtime dynamic voltage scaling: An exact algorithm and a linear-time heuristic approximation

Research output: Contribution to journalConference article

24 Scopus citations

Abstract

Dynamic voltage/frequency scaling (DVFS) has been shown to be an efficient power/energy reduction technique. Various runtime DVFS policies have been proposed to utilize runtime DVFS opportunities. However, it is hard to know if runtime DVFS opportunities have been fully exploited by a DVFS policy without knowing the upper bounds of possible energy savings. We propose an exact but exponential algorithm to determine the upper bound of energy savings. The algorithm takes into consideration the switching costs, discrete voltage/frequency voltage levels and different program states. We then show a fast linear time heuristic can provide a very close approximate to this bound.

Original languageEnglish (US)
Pages (from-to)287-292
Number of pages6
JournalProceedings of the International Symposium on Low Power Electronics and Design
StatePublished - Dec 12 2005
Event2005 International Symposium on Low Power Electronics and Design - San Diego, CA, United States
Duration: Aug 8 2005Aug 10 2005

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Keywords

  • Bounds on Energy Savings
  • Dynamic Voltage Scaling
  • Linear Time
  • Low Power

Fingerprint Dive into the research topics of 'Bounds on power savings using runtime dynamic voltage scaling: An exact algorithm and a linear-time heuristic approximation'. Together they form a unique fingerprint.

  • Cite this