Path Finding for 3D Power Distribution Networks A. B. Kahng and C. K. Cheng UC San Diego Feb 18, 2011.

Slides:



Advertisements
Similar presentations
THERMAL-AWARE BUS-DRIVEN FLOORPLANNING PO-HSUN WU & TSUNG-YI HO Department of Computer Science and Information Engineering, National Cheng Kung University.
Advertisements

Exploring 3D Power Distribution Network Physics
Efficient Design and Analysis of Robust Power Distribution Meshes Puneet Gupta Blaze DFM Inc. Andrew B. Kahng.
5-1 Chapter 5 Tree Searching Strategies. 5-2 Satisfiability problem Tree representation of 8 assignments. If there are n variables x 1, x 2, …,x n, then.
Paul Falkenstern and Yuan Xie Yao-Wen Chang Yu Wang Three-Dimensional Integrated Circuits (3D IC) Floorplan and Power/Ground Network Co-synthesis ASPDAC’10.
Power Grid Sizing via Convex Programming Peng Du, Shih-Hung Weng, Xiang Hu, Chung-Kuan Cheng University of California, San Diego 1.
1 EL736 Communications Networks II: Design and Algorithms Class8: Networks with Shortest-Path Routing Yong Liu 10/31/2007.
Spring 2012, Apr 4...ELEC 7770: Advanced VLSI Design (Agrawal)1 ELEC 7770 Advanced VLSI Design Spring 2012 Power and Ground Vishwani D. Agrawal James J.
Externally Tested Scan Circuit with Built-In Activity Monitor and Adaptive Test Clock Priyadharshini Shanmugasundaram Vishwani D. Agrawal.
Fuzzy Simulated Evolution for Power and Performance of VLSI Placement Sadiq M. Sait Habib Youssef Junaid A. KhanAimane El-Maleh Department of Computer.
Supply Voltage Degradation Aware Analytical Placement Andrew B. Kahng, Bao Liu and Qinke Wang UCSD CSE Department {abk, bliu,
Fuzzy Simulated Evolution for Power and Performance of VLSI Placement Sadiq M. SaitHabib Youssef Junaid A. KhanAimane El-Maleh Department of Computer Engineering.
Jan 6-10th, 2007VLSI Design A Reduced Complexity Algorithm for Minimizing N-Detect Tests Kalyana R. Kantipudi Vishwani D. Agrawal Department of Electrical.
Effects of Global Interconnect Optimizations on Performance Estimation of Deep Sub-Micron Design Yu (Kevin) Cao 1, Chenming Hu 1, Xuejue Huang 1, Andrew.
Analytical Thermal Placement for VLSI Lifetime Improvement and Minimum Performance Variation Andrew B. Kahng †, Sung-Mo Kang ‡, Wei Li ‡, Bao Liu † † UC.
Fuzzy Evolutionary Algorithm for VLSI Placement Sadiq M. SaitHabib YoussefJunaid A. Khan Department of Computer Engineering King Fahd University of Petroleum.
Statistical Gate Delay Calculation with Crosstalk Alignment Consideration Andrew B. Kahng, Bao Liu, Xu Xu UC San Diego
UC San Diego Computer Engineering. VLSI CAD Laboratory.. UC San Diego Computer EngineeringVLSI CAD Laboratory.. UC San Diego Computer EngineeringVLSI CAD.
7/13/ EE4271 VLSI Design VLSI Routing. 2 7/13/2015 Routing Problem Routing to reduce the area.
Routing 2 Outline –Maze Routing –Line Probe Routing –Channel Routing Goal –Understand maze routing –Understand line probe routing.
1 Reconfigurable ECO Cells for Timing Closure and IR Drop Minimization TingTing Hwang Tsing Hua University, Hsin-Chu.
Decoupling Capacitance Allocation for Power Supply Noise Suppression Shiyou Zhao, Kaushik Roy, Cheng-Kok Koh School of Electrical & Computer Engineering.
More Realistic Power Grid Verification Based on Hierarchical Current and Power constraints 2 Chung-Kuan Cheng, 2 Peng Du, 2 Andrew B. Kahng, 1 Grantham.
Modern VLSI Design 4e: Chapter 7 Copyright  2008 Wayne Wolf Topics Global interconnect. Power/ground routing. Clock routing. Floorplanning tips. Off-chip.
Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Topics n Standard cell-based layout. n Channel routing. n Simulation.
Pattern Selection based co-design of Floorplan and Power/Ground Network with Wiring Resource Optimization L. Li, Y. Ma, N. Xu, Y. Wang and X. Hong WuHan.
EE 5900 Advanced Algorithms for Robust VLSI CAD, Spring 2009 Static Timing Analysis and Gate Sizing.
On-chip power distribution in deep submicron technologies
A Polynomial Time Approximation Scheme For Timing Constrained Minimum Cost Layer Assignment Shiyan Hu*, Zhuo Li**, Charles J. Alpert** *Dept of Electrical.
Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation.
Modern VLSI Design 3e: Chapters 1-3 week12-1 Lecture 30 Scale and Yield Mar. 24, 2003.
BSG-Route: A Length-Matching Router for General Topology T. Yan and M. D. F. Wong University of Illinois at Urbana-Champaign ICCAD 2008.
-1- UC San Diego / VLSI CAD Laboratory Construction of Realistic Gate Sizing Benchmarks With Known Optimal Solutions Andrew B. Kahng, Seokhyeong Kang VLSI.
Modern VLSI Design 2e: Chapter 3 Copyright  1998 Prentice Hall PTR Topics n Electrical properties of static combinational gates: –transfer characteristics;
EE 201C Modeling of VLSI Circuits and Systems
Kwangsoo Han, Andrew B. Kahng, Hyein Lee and Lutong Wang
Logical Topology Design
A Faster Approximation Scheme for Timing Driven Minimum Cost Layer Assignment Shiyan Hu*, Zhuo Li**, and Charles J. Alpert** *Dept of ECE, Michigan Technological.
Layout-Driven Test-Architecture Design and Optimization for 3D SoCs under Pre-Bond Test- Pin-Count Constraint Li Jiang 1, Qiang Xu 1, Krishnendu Chakrabarty.
Register Placement for High- Performance Circuits M. Chiang, T. Okamoto and T. Yoshimura Waseda University, Japan DATE 2009.
1 Efficient Obstacle-Avoiding Rectilinear Steiner Tree Construction Chung-Wei Lin, Szu-Yu Chen, Chi-Feng Li, Yao-Wen Chang, Chia-Lin Yang National Taiwan.
1 A Fast Algorithm for Power Grid Design Jaskirat Singh Sachin Sapatnekar Department of Electrical and Computer Engineering University of Minnesota.
10/03/2005: 1 Physical Synthesis of Latency Aware Low Power NoC Through Topology Exploration and Wire Style Optimization CK Cheng CSE Department UC San.
1 SYNTHESIS of PIPELINED SYSTEMS for the CONTEMPORANEOUS EXECUTION of PERIODIC and APERIODIC TASKS with HARD REAL-TIME CONSTRAINTS Paolo Palazzari Luca.
Javad Lavaei Department of Electrical Engineering Columbia University Convex Relaxation for Polynomial Optimization: Application to Power Systems and Decentralized.
Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation.
Simultaneous Analog Placement and Routing with Current Flow and Current Density Considerations H.C. Ou, H.C.C. Chien and Y.W. Chang Electronics Engineering,
Distributed Computation: Circuit Simulation CK Cheng UC San Diego
Power Integrity Test and Verification CK Cheng UC San Diego 1.
EE 201C Modeling of VLSI Circuits and Systems
1 Slides by Yong Liu 1, Deep Medhi 2, and Michał Pióro 3 1 Polytechnic University, New York, USA 2 University of Missouri-Kansas City, USA 3 Warsaw University.
Modern VLSI Design 3e: Chapter 3 Copyright  1998, 2002 Prentice Hall PTR Topics n Electrical properties of static combinational gates: –transfer characteristics;
Outline Motivation and Contributions Related Works ILP Formulation
1 Revamping Electronic Design Process to Embrace Interconnect Dominance Chung-Kuan Cheng CSE Department UC San Diego La Jolla, CA
-1- UC San Diego / VLSI CAD Laboratory Optimization of Overdrive Signoff Tuck-Boon Chan, Andrew B. Kahng, Jiajia Li and Siddhartha Nath Tuck-Boon Chan,
1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),
Dept. of Electronics Engineering & Institute of Electronics National Chiao Tung University Hsinchu, Taiwan ISPD’16 Generating Routing-Driven Power Distribution.
1 Hardware Reliability Margining for the Dark Silicon Era Liangzhen Lai and Puneet Gupta Department of Electrical Engineering University of California,
1 Chapter 5 Branch-and-bound Framework and Its Applications.
EE4271 VLSI Design VLSI Channel Routing.
VLSI Physical Design Automation
Homework 3 (Due 3/10) Submit code and report to:
Homework 3 (Due 3/10) Submit code and report to:
Nodes, Branches, and Loops
EE 201C Modeling of VLSI Circuits and Systems
Energy Efficient Power Distribution on Many-Core SoC
EE4271 VLSI Design, Fall 2016 VLSI Channel Routing.
VLSI Physical Design Automation
11.3 Coordinate Plane Math 1.
Clock Tree Routing With Obstacles
Presentation transcript:

Path Finding for 3D Power Distribution Networks A. B. Kahng and C. K. Cheng UC San Diego Feb 18, 2011

Power Grid Optimization Based on Rent’s Rule 2 Higher current density in the inner grid Lowest current density Highest current density We consider one quarter of the power grid Vdd

Power Grid Topology Quarter of Die: 200um X 200um Four Metal Layers: M1, M3, M6, AP Wire Direction: M1- horizontal, M3-vertical, M6-Horizontal, AP- vertical

Power Grid Parameters Pitch Initial Width Range Local Density Constraint Min-max Constraint M12.5um0.17umN/A M38.0um0.25umN/A M620um4.2um 2um- 8um 15%-80% 2um- 12um AP40um10um 3um- 16um 15%-80% 2um- 35um “Local Density “ is defined as (2*width)/pitch. “Width Range” is determined by intersection of “Local Density Constraint” and “Min-max Constraint”. Total metal area for M6 and AP layers are fixed.

Current Sources Based on Rent’s Rule Current source density function: I(d) =c*d^α ; S={(x, y)| (x, y) is the position of a node in M1} ; We put a input source I (x,y) for every (x,y) in S such that ; The total power in an area of d*d is c*d^β where β=(α+2)/2; 5

Problem Formulation Inputs from the user: – Topology of power grid; – Default resistances of branches; – Possible current distributions satisfying Rent’s rule; Optimization for static voltage drop: Minimize (Maximum IR drop for all possible current distributions) Subject to – Total wire areas for M6 and AP are fixed; – Lower bound and upper bound for resistances of branches; 6

Previous Work P. Gupta and A.B. Kahng, "Efficient Design and Analysis of Robust Power Distribution Meshes", Proc. International Conference on VLSI Design, Jan. 2006, pp W. Zhang, L. Zhang, etc, “On-chip power network optimization with decoupling capacitors and controlled-ESRs”, ASP-DAC, 2010, pp A. Ghosh, S. Boyd and A. Saberi, “Minimizing effective resistance of a graph”, SIAM Review, problems and techniques section, Feb. 2008, 50(1): pp L. Vandenberghe, S. Boyd and A. El Gamal, “Optimal Wire and Transistor Sizing for Circuits with Non-Tree Topology”, IEEE/ACM International Conference on Computer-Aided Design, Nov 1997, pp S. Boyd, “Convex Optimization of Graph Laplacian Eigenvalues”, Proceedings International Congress of Mathematicians, 2006, 3: pp

Design of Experiments Two optimization methods – Nonlinear programming – Heuristic search Fourteen current peak positions (red dots in the left figure) and four β values 0.25,0.5,0.75,1.0 for testing. The coordinates of the fourteen peak positions are (0,0), (50,0),(50,50), (100,0),(100,50),(100,100), (150,0),(150,50),(150,100),(150,150), (200,0),(200,50),(200,100),(200,150). VD = worst voltage drop of the power grid over all locations and all current distributions satisfying power law.

Method 1: nonlinear programming (NLP) The whole flow of NLP for wire sizing optimization with fixed current distribution. The current peak locates at origin.

Sizing Results of NLP Segment, β=0.75, VD=0.2941Wire, β=0.75, VD= Segment, β=1.0, VD=0.2945Wire, β=1.0, VD= VD for uniform sizing =

Sizing Results of NLP Segment, β=0.25, VD=0.2921Wire, β=0.25, VD= Segment, β=0.5, VD=0.2932Wire, β=0.5, VD= VD for uniform sizing =

Observations When β is large (i.e. current sources distribute uniformly), the results suggest putting most of wire resources near the voltage source. When β is small (i.e. most of current sources gather at origin), we should give some wire resources to segments near the origin. “Segment” optimization results are more stable than “Wire” optimization results relative to change of β.

Method 2: Heuristic search The candidates include all combinations of w l,w h,p l,p h. The curve part is fitted by a polynomial function satisfying area constraints. The best wire sizing result is chosen to minimize the worst voltage drop over all locations and all possible current distributions with different peaks and β value.

Sizing Results of Heuristic Search Each wire is assumed to have the same width. VD for uniform sizing = VD for optimized sizing =

Width Range Adjustment for M6 M6 : 3um-7um AP : 3um-16um VD = M6 : 4um-6um AP : 3um-16um VD = Original Setup M6 : 2um-8um AP : 3um-16um VD =

Width Range Adjustment for AP M6 : 2um-8um AP : 5um-14um VD = M6 : 2um-8um AP : 7um-12um VD = Original Setup M6 : 2um-8um AP : 3um-16um VD =

Width Range Adjustment for Both M6 and AP M6 : 4um-6um AP : 5um-14um VD = M6 : 3um-7um AP : 5um-14um VD = Original Setup M6 : 2um-8um AP : 3um-16um VD = M6 : 3um-7um AP : 7um-12um VD = M6 : 4um-6um AP : 7um-12um VD =

Observations The heuristic search method performs better than NLP methods on the objective of minimizing maximum voltage drop over all locations and current distributions. Adjustment of width range of AP has more effect on performance of optimized sizing results than adjustment of width range of M6.

Area Budget Adjustment between M6 and AP The sizing results of both methods achieve smaller voltage drop when more area resources are allocated from AP to M6. M6 Initial Width AP Initial Width 4.2um-90% Satisfying Area Constraints 4.2um-75% 4.2um-60% … 4.2um+75% 4.2um+90%