skip to main content
10.1145/3400302.3415711acmconferencesArticle/Chapter ViewAbstractPublication PagesiccadConference Proceedingsconference-collections
research-article
Public Access

A fast learning-driven signoff power optimization framework

Published: 17 December 2020 Publication History

Abstract

Modern high-performance System-on-Chip (SoC) design flows highly depend on signoff tools to perform timing-constrained power optimization through Engineering Change Orders (ECOs), which involve gate-sizing and Vth-assignment of standard cells. However, ECOs are highly time-consuming, and the power improvement is unknown in advance. Ever since the industrial benchmarks released by the ISPD-2012 gate-sizing contest, active research has been conducted extensively. Nonetheless, previous works were mostly based on heuristics or analytical methods whose timing models were over-simplified and lacked formal validations from commercial signoff tools. In this paper, we propose ECO-GNN, a transferable graph-learning-based framework, which harnesses graph neural networks (GNNs) to perform commercial-quality signoff power optimization through discrete Vth-assignment. Our framework generates tool-accurate optimization results instantly on unseen netlists that are not utilized in the training process. Furthermore, we implement a GNN-based explanation method to interpret the optimization results achieved by our framework. Experimental results on 14 industrial designs, including a RISC-V-based multi-core system and the renowned ISPD-2012 benchmarks, demonstrate that our framework achieves up to 14X runtime improvement with similar signoff power optimization quality compared with Synopsys PrimeTime.

References

[1]
K. Asanovic, R. Avizienis, J. Bachrach, S. Beamer, D. Biancolin, C. Celio, H. Cook, D. Dabbelt, J. Hauser, A. Izraelevitz, et al. The rocket chip generator. <u>EECS Department, University of California, Berkeley, Tech. Rep. UCB/EECS-2016-17</u>, 2016.
[2]
S. Bao. Optimizing leakage power using machine learning. <u>CS Department, Stanford University</u>, 2010.
[3]
T. M. Fruchterman and E. M. Reingold. Graph drawing by force-directed placement. <u>Software: Practice and experience</u>, 21(11):1129--1164, 1991.
[4]
W. Hamilton, Z. Ying, and J. Leskovec. Inductive representation learning on large graphs. In <u>Advances in neural information processing systems</u>, pages 1024--1034, 2017.
[5]
M. Hashimoto, H. Onodera, and K. Tamaru. A power optimization method considering glitch reduction by gate sizing. In <u>Proceedings of the 1998 international symposium on Low power electronics and design</u>, pages 221--226, 1998.
[6]
J. Hu, A. B. Kahng, S. Kang, M.-C. Kim, and I. L. Markov. Sensitivity-guided metaheuristics for accurate discrete gate sizing. In <u>Proceedings of the International Conference on Computer-Aided Design</u>, pages 233--239, 2012.
[7]
D. P. Kingma and J. Ba. Adam: A method for stochastic optimization. <u>arXiv preprint arXiv:1412.6980</u>, 2014.
[8]
L. Li, P. Kang, Y. Lu, and H. Zhou. An efficient algorithm for library-based cell-type selection in high-performance low-power designs. In <u>Proceedings of the International Conference on Computer-Aided Design</u>, pages 226--232. ACM, 2012.
[9]
Y. Liu and J. Hu. A new algorithm for simultaneous gate sizing and threshold voltage assignment. <u>IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems</u>, 29(2):223--234, 2010.
[10]
S. Mok, J. Lee, and P. Gupta. Discrete sizing for leakage power optimization in physical design: A comparative study. <u>ACM Transactions on Design Automation of Electronic Systems (TODAES)</u>, 18(1):15, 2013.
[11]
W. Ning. Strongly np-hard discrete gate-sizing problems. <u>IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems</u>, 13(8):1045--1051, 1994.
[12]
M. M. Ozdal, C. Amin, A. Ayupov, S. Burns, G. Wilke, and C. Zhuo. The ispd-2012 discrete cell sizing contest and benchmark suite. In <u>Proceedings of the 2012 ACM international symposium on International Symposium on Physical Design</u>, pages 161--164. ACM, 2012.
[13]
M. M. Ozdal, S. Burns, and J. Hu. Gate sizing and device technology selection algorithms for high-performance industrial designs. In <u>Proceedings of the International Conference on Computer-Aided Design</u>, pages 724--731. IEEE Press, 2011.
[14]
S. Patanjali, M. Patnaik, S. Potluri, and V. Kamakoti. Mltimer: Leakage power minimization in digital circuits using machine learning and adaptive lazy timing analysis. <u>Journal of Low Power Electronics</u>, 14(2):285--301, 2018.
[15]
M. Rahman and C. Sechen. Post-synthesis leakage power minimization. In <u>2012 Design, Automation & Test in Europe Conference & Exhibition (DATE)</u>, pages 99--104. IEEE, 2012.
[16]
T. Reimann, G. Posser, G. Flach, M. Johann, and R. Reis. Simultaneous gate sizing and vt assignment using fanin/fanout ratio and simulated annealing. In <u>2013 IEEE International Symposium on Circuits and Systems (ISCAS2013)</u>, pages 2549--2552. IEEE, 2013.
[17]
S. Roy, W. Chen, C. C.-P. Chen, and Y. H. Hu. Numerically convex forms and their application in gate sizing. <u>IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems</u>, 26(9):1637--1647, 2007.
[18]
S. Roy, D. Liu, J. Um, and D. Z. Pan. Osfa: A new paradigm of gate-sizing for power/performance optimizations under multiple operating conditions. In <u>Design Automation Conference</u>, page 129. ACM, 2015.
[19]
A. Sharma, D. Chinnery, S. Bhardwaj, and C. Chu. Fast lagrangian relaxation based gate sizing using multi-threading. In <u>2015 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)</u>, pages 426--433. IEEE, 2015.
[20]
J. Singh, V. Nookala, Z.-Q. Luo, and S. Sapatnekar. Robust gate sizing by geometric programming. In <u>Proceedings. 42nd Design Automation Conference, 2005.</u>, pages 315--320. IEEE, 2005.
[21]
S. Sirichotiyakul, T. Edwards, C. Oh, and J. Zuo. Primetime user guide: Fundamentals, 2005.
[22]
J. B. White and P. Sadayappan. On improving the performance of sparse matrix-vector multiplication. In <u>Proceedings Fourth International Conference on High-Performance Computing</u>, pages 66--71. IEEE, 1997.
[23]
Z. Wu, S. Pan, F. Chen, G. Long, C. Zhang, and S. Y. Philip. A comprehensive survey on graph neural networks. <u>IEEE Transactions on Neural Networks and Learning Systems</u>, 2020.
[24]
R. Ying, D. Bourgeois, J. You, M. Zitnik, and J. Leskovec. Gnn explainer: A tool for post-hoc explanation of graph neural networks. <u>arXiv preprint arXiv:1903.03894</u>, 2019.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
ICCAD '20: Proceedings of the 39th International Conference on Computer-Aided Design
November 2020
1396 pages
ISBN:9781450380263
DOI:10.1145/3400302
  • General Chair:
  • Yuan Xie
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

In-Cooperation

  • IEEE CAS
  • IEEE CEDA
  • IEEE CS

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 December 2020

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Funding Sources

  • National Science Foundation

Conference

ICCAD '20
Sponsor:

Acceptance Rates

Overall Acceptance Rate 457 of 1,762 submissions, 26%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)140
  • Downloads (Last 6 weeks)18
Reflects downloads up to 06 Jan 2025

Other Metrics

Citations

Cited By

View all

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media