skip to main content
article

Voltage scheduling under unpredictabilities: a risk management paradigm

Published: 01 April 2005 Publication History

Abstract

This article addresses the problem of voltage scheduling in unpredictable situations. The voltage scheduling problem assigns voltages to operations such that the power is minimized under a clock delay constraint. In the presence of unpredictabilities, meeting the clock latency constraint cannot be guaranteed. This article proposes a novel risk management based technique to solve this problem. Here, the risk management paradigm assigns a quantified value to the amount of risk the designer is willing to take on the clock cycle constraint. The algorithm then assigns voltages in order to meet the expected value of clock cycle constraint while keeping the maximum delay within the specified “risk” and minimizing the power. The proposed algorithm is based on dynamic programming and is optimal for trees. Experimental results show that the traditional voltage scheduling approach is incapable of handling unpredictabilities. Our approach is capable of generating an effective tradeoff between power and “risk”: the more the risk, the less the power. The results show that a small increase in design risk positively affects the power dissipation.

References

[1]
Chandrakasan, A. P., Sheng, S., and Brodersen, R. W. 1992. Low power CMOS digital design. IEEE J. Solid State Circ. 27, 4 (April), 472--484.
[2]
Chang, J. M. and Pedram, M. 1995. Low power register allocation and binding. In Proceedings of the Design Automation Conference. 29--35.
[3]
Chang. J. M. and Pedram, M. 1997. Energy minimization using multiple supply voltages. IEEE Trans. VLSI Syst. 5, 2.
[4]
Chen, C., Srivastava, A., and Sarrafzadeh, M. 2001. On gate level power optimization using dual suppply voltages. IEEE Trans. VLSI Syst. 9, 5 (Oct.), 616--629.
[5]
Chung, E. Y., Benini, L., and DeMicheli, G. 1999. Dynamic power management using adpative learning tree. In Proceedings of the International Conference on Computer Aided Design.
[6]
Jyu, H.-F. and Malik, S. 1993. Statistical timing optimization of combinational logic circuits. In Proceedings of the International Conference on Computer Design. 77--80.
[7]
Jyu, H.-F. and Malik, S. 1994. Statistical delay modeling in logic design and synthesis. In Proceedings of the Design Automation Conference. 126--130.
[8]
Kruse, L., Schmidt, E., Jochens, G., Stammermann, A., Schulz, A., Macii, E., and Nebel, W. 2001. Estimation of lower and upper bounds on the power consumption from scheduled data flow graphs. IEEE Trans. VLSI Syst. 9, 1 (Feb.), 3--14.
[9]
Lee, C., Potkonjak, M., and Mangione-Smith, W. H. 1997. MediaBench: A tool for evaluating and synthesizing multimedia and communications systems. In Proceedings of the International Symposium on Microarchitecture.
[10]
Pedram, M. 1996. Power minimization in IC design: Principles and applications. ACM Trans. Des. Automat. Electron. Syst. 1, 1 (Jan.), 3--56.
[11]
Raje, S. and Sarrafzadeh, M. 1995. Variable voltage scheduling. In Proceedings of the International Workshop on Low Power Design.
[12]
Srivastava, A. and Sarrafzadeh, M. 2002. Predictability: Definition, analysis and optimization. In Proceedings of the International Conference on Computer Aided Design.
[13]
Tellez, G. E., Farrahi, A., and Sarrafzadeh, M. 1995. Activity-driven clock design for low power circuits. In Proceedings of the IEEE International Conference on Computer Aided Design. 62--65.
[14]
Tomiyama, H., Inoue, A., and Yasuura, H. 1998. Statistical performance driven module binding in high level synthesis. In Proceedings of the International Symposium on System Synthesis. 66--71.
[15]
Tomiyama, H. and Yasuura, H. 1998. Module selection using manufacturing information. In IEICE Trans. Fund. E81-A, 12 (Dec.), 2576--2584.

Cited By

View all
  • (2006)A statistical methodology for wire-length predictionIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2005.85588525:7(1327-1336)Online publication date: 1-Jul-2006
  • (2005)Power-driven simultaneous resource binding and floorplanningIEEE Transactions on Very Large Scale Integration (VLSI) Systems10.1109/TVLSI.2005.85361813:8(934-942)Online publication date: 1-Aug-2005
  • (2005)Simultaneous floorplanning and resource binding: a probabilistic approachProceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005.10.1109/ASPDAC.2005.1466218(517-522)Online publication date: 2005
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Design Automation of Electronic Systems
ACM Transactions on Design Automation of Electronic Systems  Volume 10, Issue 2
April 2005
244 pages
ISSN:1084-4309
EISSN:1557-7309
DOI:10.1145/1059876
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Journal Family

Publication History

Published: 01 April 2005
Published in TODAES Volume 10, Issue 2

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Predictability
  2. design closure
  3. low power
  4. voltage scheduling

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)1
Reflects downloads up to 15 Sep 2024

Other Metrics

Citations

Cited By

View all
  • (2006)A statistical methodology for wire-length predictionIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2005.85588525:7(1327-1336)Online publication date: 1-Jul-2006
  • (2005)Power-driven simultaneous resource binding and floorplanningIEEE Transactions on Very Large Scale Integration (VLSI) Systems10.1109/TVLSI.2005.85361813:8(934-942)Online publication date: 1-Aug-2005
  • (2005)Simultaneous floorplanning and resource binding: a probabilistic approachProceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005.10.1109/ASPDAC.2005.1466218(517-522)Online publication date: 2005
  • (2004)Empirical models for net-length probability distribution and applicationsIEEE Transactions on Very Large Scale Integration (VLSI) Systems10.1109/TVLSI.2004.83423512:10(1066-1075)Online publication date: 1-Oct-2004

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