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

Limiting Interconnect Heating in Power-Driven Physical Synthesis

Published: 27 January 2023 Publication History

Abstract

Current technology trend of VLSI chips includes sub-10 nm nodes and 3D ICs. Unfortunately, due to significantly increased Joule heating in these technologies, interconnect reliability has become a significant casualty. In this paper, we explore how interconnect power dissipation (of CV2/2 per logic transition) and thus heating can be effectively constrained during a power-optimizing physical synthesis (PS) flow that applies three different PS transformations: cell sizing, Vth assignment and cell replication; the latter is particularly useful for limiting interconnect heating. Other constraints considered are timing, slew and cell fanout load. To address this multi-constraint power-optimization problem effectively, we consider the application of the aforementioned three transforms simultaneously (as opposed to sequentially in some order) as well as simultaneously across all cells of the circuit using a novel discrete optimization technique called discretized network flow (DNF). We applied our algorithm to ISPD-13 benchmark circuits: the ISPD-13 competition was for power optimization for cell-sizing and Vth assignment transforms under timing, slew and cell fanout load constraints; to these we added the interconnect heating constraint and the cell replication transform---a much harder transform to engineer in a simultaneous-consideration framework than the other two. Results show the significant efficacy of our techniques.

References

[1]
Li, M. (2016). Joule Heating Induced Interconnect Failure in 3D IC Technology,. PhD Thesis, 2016, UCLA. https://escholarship.org/uc/item/1pf907hr
[2]
J. Hu et al. Sensitivity-guided metaheuristics for accurate discrete gate sizing. In IEEE/ACM International Conference on Computer-Aided Design, pages 233--239, 2012.
[3]
L. Li et al. An efficient algorithm for library-based cell-type selection in high-performance low-power designs. In IEEE/ACM International Conference on Computer-Aided Design, pages 226--232. IEEE, 2012.
[4]
V. S. Livramento et al. A hybrid technique for discrete gate sizing based on lagrangian relaxation. ACM Transactions on Design Automation of Electronic Systems, 19(4):40, 2014.
[5]
A. Sharma et al. Fast Lagrangian relaxation based gate sizing usingmulti-threading. In IEEE/ACM International Conference on Computer-Aided Design, pages 426--433. IEEE, 2015.
[6]
A. Sharma, D. Chinnery, S. Dhamdhere and C. Chu, "Rapid gate sizing with fewer iterations of Lagrangian Relaxation," 2017 IEEE/ACM International Conference on Computer-Aided Design (ICCAD), 2017, pp. 337--343.
[7]
G. Flach et. al. Effective Method for Simultaneous Gate Sizing and Vth Assignment Using Lagrangian Relaxation. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 33(4):546--557, 2014.
[8]
F. Gao, and J. P. Hayes, "Total power reduction in CMOS circuits via gate sizing and multiple threshold voltages", in Proc. Des. Autom. Conf., pp. 31--36, 2005.
[9]
A. Srivastava, D. Sylvester, and D. Blaauw, "Power minimization using simultaneous gate sizing, dual-Vdd and dual-Vth assignment", in Proc. Des. Autom. Conf., pp. 783--787, 2004.
[10]
H. Ren and S. Dutt, "Effective Power Optimization via Simultaneous Vdd, Vth Assignments, Gate-Sizing and Placement Under Timing and Voltage-Island Constraints", IEEE Trans. CAD, 30(5): 746--759, May 2011.
[11]
D. Chinnery and K. Keutzer, "Linear programming for sizing, vth and vdd assignment," in Proc. International Symposium on Low Power Electronics and Design, 2005, pp. 149--154.
[12]
S. Shah, et. al., "Discrete vt assignment and gate sizing using a self-snapping continuous formulation," ICCAD, 2005, pp. 705--712.
[13]
H. Chou, Y.-H. Wang, and C. C.-P. Chen, "Fast and effective gate-sizing with multiple-vt assignment using generalized lagrangian relaxation," ASP-DAC, 2005.
[14]
S. Roy, et. al., "Numerically convex forms and their application in gate sizing," IEEE Transactions on Computer Aided Design, 2007.
[15]
H. Tennakoon and C. Sechen, "Efficient and accurate gate sizing with piecewise convex delay models," DAC, 2005.
[16]
H Tennakoon and C Sechen, "Gate sizing using Lagrangian relaxation combined with a fast gradient-based pre-processing step," In Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design, 2002.
[17]
J. Wang, D. Das, and H. Zhou, "Gate sizing by lagrangian relaxation revisited," ICCAD, 2007.
[18]
S. Hu, M. Ketkar, and J. Hu, "Gate sizing for cell-library-based designs," IEEE Transactions on Computer Aided Design, 2009.
[19]
Y Liu and J Hu, "GPU-based parallelization for fast circuit optimization," TODAES, 2011.
[20]
Y. Liu and J. Hu. A new algorithm for simultaneous gate sizing and threshold voltage assignment. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 29(2):223--234, 2010.
[21]
M. Ozdal, S. Burns, and J. Hu, "Gate sizing and device technology selection algorithms for high-performance industrial designs," in Proc. Intl. Conf. on Computer-Aided Design, 2011, pp. 724--731.
[22]
J. Wang, D. Das, and H. Zhou, "Gate sizing by lagrangian relaxation revisited," ICCAD, 2007.
[23]
M. M. Ozdal, et. al., "The ISPD-2012 discrete cell sizing contest and benchmark suite," in Proc. Intl. Symposium on Physical Design, 2012.
[24]
M. M. Ozdal et al., "An improved benchmark suite for the ISPD-2013 discrete cell sizing contest," In Proceedings of the 2013 ACM international symposium on International symposium on physical design, pages 168--170. ACM, 2013.
[25]
R. K. K. Ahuja, et al., Network Flows: Theory, Algorithms, and Applications, Pearson Education, 1993.
[26]
A. Nahapetyan, and P. Pardalos, "Adaptive Dynamic Cost Updating Procedure for Solving Fixed Charge Network Flow Problems", Computational Optimization and Applications journal, 2008.
[27]
R. Puri, D. S. Kung, and A. D. Drumm, "Fast and accurate wire delay estimation for physical synthesis of large ASICs," GLSVLSI, 2002.
[28]
R. Gupta, et. al., "The elmore delay as bound for rc trees with generalized input signals," in Proc. ACM/IEEE DAC, 1995, pp. 364--369.
[29]
J. Qian, S. Pullela, and L. Pillage, "Modeling the "effective capacitance" for the RC interconnect of CMOS gates," IEEE Trans. Computer-Aided Design Integr. Circuits Syst., vol. 13, no. 12, pp. 1526--1535, Nov. 2006.
[30]
https://www.synopsys.com/implementation-and-signoff/signoff/primetime.html

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SLIP '22: Proceedings of the 24th ACM/IEEE Workshop on System Level Interconnect Pathfinding
November 2022
46 pages
ISBN:9781450395366
DOI:10.1145/3557988
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

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 January 2023

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Funding Sources

Conference

ICCAD '22
Sponsor:

Acceptance Rates

Overall Acceptance Rate 6 of 8 submissions, 75%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 114
    Total Downloads
  • Downloads (Last 12 months)78
  • Downloads (Last 6 weeks)8
Reflects downloads up to 03 Mar 2025

Other Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media