Physical Synthesis Buffer Insertion, Gate Sizing, Wire Sizing,

Slides:



Advertisements
Similar presentations
Porosity Aware Buffered Steiner Tree Construction C. Alpert G. Gandham S. Quay IBM Corp M. Hrkic Univ Illinois Chicago J. Hu Texas A&M Univ.
Advertisements

Topics Electrical properties of static combinational gates:
TOPIC : SYNTHESIS DESIGN FLOW Module 4.3 Verilog Synthesis.
Advanced Interconnect Optimizations. Buffers Improve Slack RAT = 300 Delay = 350 Slack = -50 RAT = 700 Delay = 600 Slack = 100 RAT = 300 Delay = 250 Slack.
Courtesy RK Brayton (UCB) and A Kuehlmann (Cadence) 1 Logic Synthesis Sequential Synthesis.
Logic Synthesis – 3 Optimization Ahmed Hemani Sources: Synopsys Documentation.
Buffer and FF Insertion Slides from Charles J. Alpert IBM Corp.
ELEN 468 Lecture 261 ELEN 468 Advanced Logic Design Lecture 26 Interconnect Timing Optimization.
Xing Wei, Wai-Chung Tang, Yu-Liang Wu Department of Computer Science and Engineering The Chinese University of HongKong
Improving Placement under the Constant Delay Model Kolja Sulimma 1, Ingmar Neumann 1, Lukas Van Ginneken 2, Wolfgang Kunz 1 1 EE and IT Department University.
1 Interconnect Layout Optimization by Simultaneous Steiner Tree Construction and Buffer Insertion Presented By Cesare Ferri Takumi Okamoto, Jason Kong.
The Cost of Fixing Hold Time Violations in Sub-threshold Circuits Yanqing Zhang, Benton Calhoun University of Virginia Motivation and Background Power.
CMOS Circuit Design for Minimum Dynamic Power and Highest Speed Tezaswi Raja, Dept. of ECE, Rutgers University Vishwani D. Agrawal, Dept. of ECE, Auburn.
Penn ESE535 Spring DeHon 1 ESE535: Electronic Design Automation Day 11: March 4, 2008 Placement (Intro, Constructive)
Design of Variable Input Delay Gates for Low Dynamic Power Circuits
August 12, 2005Uppalapati et al.: VDAT'051 Glitch-Free Design of Low Power ASICs Using Customized Resistive Feedthrough Cells 9th VLSI Design & Test Symposium.
Modern VLSI Design 2e: Chapter4 Copyright  1998 Prentice Hall PTR.
Interconnect Optimizations. A scaling primer Ideal process scaling: –Device geometries shrink by  = 0.7x) Device delay shrinks by  –Wire geometries.
EE4271 VLSI Design Interconnect Optimizations Buffer Insertion.
Interconnect Optimizations
1 Application Specific Integrated Circuits. 2 What is an ASIC? An application-specific integrated circuit (ASIC) is an integrated circuit (IC) customized.
A Cost-Driven Lithographic Correction Methodology Based on Off-the-Shelf Sizing Tools.
Ryan Kastner ASIC/SOC, September Coupling Aware Routing Ryan Kastner, Elaheh Bozorgzadeh and Majid Sarrafzadeh Department of Electrical and Computer.
ELEN 468 Lecture 271 ELEN 468 Advanced Logic Design Lecture 27 Interconnect Timing Optimization II.
Layout-based Logic Decomposition for Timing Optimization Yun-Yin Lien* Youn-Long Lin Department of Computer Science, National Tsing Hua University, Hsin-Chu,
Interconnect Synthesis. Buffering Related Interconnect Synthesis Consider –Layer assignment –Wire sizing –Buffer polarity –Driver sizing –Generalized.
1 A Method for Fast Delay/Area Estimation EE219b Semester Project Mike Sheets May 16, 2000.
Advanced Interconnect Optimizations. Timing Driven Buffering Problem Formulation Given –A Steiner tree –RAT at each sink –A buffer type –RC parameters.
Placement-Centered Research Directions and New Problems Xiaojian Yang Amir Farrahi Synplicity Inc.
Signal Integrity Methodology on 300 MHz SoC using ALF libraries and tools Wolfgang Roethig, Ramakrishna Nibhanupudi, Arun Balakrishnan, Gopal Dandu Steven.
03/30/031 ECE 551: Digital System Design & Synthesis Lecture Set 9 9.1: Constraints and Timing 9.2: Optimization (In separate file)
Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Topics n Interconnect design. n Crosstalk. n Power optimization.
Global Routing.
CAD for Physical Design of VLSI Circuits
ASIC Design Flow – An Overview Ing. Pullini Antonio
Logic Synthesis for Low Power(CHAPTER 6) 6.1 Introduction 6.2 Power Estimation Techniques 6.3 Power Minimization Techniques 6.4 Summary.
March 20, 2007 ISPD An Effective Clustering Algorithm for Mixed-size Placement Jianhua Li, Laleh Behjat, and Jie Huang Jianhua Li, Laleh Behjat,
An Efficient Clustering Algorithm For Low Power Clock Tree Synthesis Rupesh S. Shelar Enterprise Microprocessor Group Intel Corporation, Hillsboro, OR.
1 Wire Length Prediction-based Technology Mapping and Fanout Optimization Qinghua Liu Malgorzata Marek-Sadowska VLSI Design Automation Lab UC-Santa Barbara.
HDL-Based Layout Synthesis Methodologies Allen C.-H. Wu Department of Computer Science Tsing Hua University Hsinchu, Taiwan, R.O.C {
VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 5: Global Routing © KLMH Lienig 1 EECS 527 Paper Presentation Techniques for Fast.
CSE 494: Electronic Design Automation Lecture 2 VLSI Design, Physical Design Automation, Design Styles.
Massachusetts Institute of Technology 1 L14 – Physical Design Spring 2007 Ajay Joshi.
Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Combinational network delay. n Logic optimization.
Optimal digital circuit design Mohammad Sharifkhani.
Introduction to CMOS VLSI Design Lecture 5: Logical Effort GRECO-CIn-UFPE Harvey Mudd College Spring 2004.
Placement. Physical Design Cycle Partitioning Placement/ Floorplanning Placement/ Floorplanning Routing Break the circuit up into smaller segments Place.
Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Interconnect design. n Crosstalk. n Power optimization.
EE 466/586 VLSI Design Partha Pande School of EECS Washington State University
Fast Algorithms for Slew Constrained Minimum Cost Buffering S. Hu*, C. Alpert**, J. Hu*, S. Karandikar**, Z. Li*, W. Shi* and C. Sze** *Dept of ECE, Texas.
ECE 260B – CSE 241A /UCB EECS Kahng/Keutzer/Newton Physical Design Flow Read Netlist Initial Placement Placement Improvement Cost Estimation Routing.
Routing Tree Construction with Buffer Insertion under Obstacle Constraints Ying Rao, Tianxiang Yang Fall 2002.
Introduction to Clock Tree Synthesis
Interconnect/Via.
Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Topics n Combinational network delay. n Logic optimization.
Net Criticality Revisited: An Effective Method to Improve Timing in Physical Design H. Chang 1, E. Shragowitz 1, J. Liu 1, H. Youssef 2, B. Lu 3, S. Sutanthavibul.
Modern VLSI Design 3e: Chapter 3 Copyright  1998, 2002 Prentice Hall PTR Topics n Electrical properties of static combinational gates: –transfer characteristics;
Static Timing Analysis
Incorporating Driver Sizing Into Buffer Insertion Via a Delay Penalty Technique Chuck Alpert, IBM Chris Chu, Iowa State Milos Hrkic, UIC Jiang Hu, IBM.
-1- Delay Uncertainty and Signal Criticality Driven Routing Channel Optimization for Advanced DRAM Products Samyoung Bang #, Kwangsoo Han ‡, Andrew B.
1 Timing Closure and the constant delay paradigm Problem: (timing closure problem) It has been difficult to get a circuit that meets delay requirements.
An O(nm) Time Algorithm for Optimal Buffer Insertion of m Sink Nets Zhuo Li and Weiping Shi {zhuoli, Texas A&M University College Station,
Proximity Optimization for Adaptive Circuit Design Ang Lu, Hao He, and Jiang Hu.
6/19/ VLSI Physical Design Automation Prof. David Pan Office: ACES Placement (3)
RTL Design Flow RTL Synthesis HDL netlist logic optimization netlist Library/ module generators physical design layout manual design a b s q 0 1 d clk.
ASIC Design Methodology
The Interconnect Delay Bottleneck.
EE141 Design Styles and Methodologies
Timing Analysis 11/21/2018.
Clock Tree Routing With Obstacles
Presentation transcript:

Physical Synthesis Buffer Insertion, Gate Sizing, Wire Sizing,

2 Physical Synthesis Wire delays  Timing closure problem:  Integration of synthesis with physical design −Not very successful −Reason: highly complex tasks Today, design closure:  Multi-objectives must be managed: −Performance −Area −Routability −Yield −Clock skew −Power −Signal integrity

3 Physical Synthesis Physical synthesis:  Modify netlist (decisions made at logic synthesis) after/during physical design to achieve design closure  Primary purpose: to meet timing constraints (timing closure)

4 Physical Synthesis Improve timing critical nets by: 1.Buffer insertion (BI) in the middle of the nets, 2.Gate sizing (GS) for the drivers, 3.Wire sizing, 4.Retiming.  Automated BI and GS techniques have been integrated into the timing driven Place and Route design [1] −[1] Astro Place and Route, Synopsys Inc.  Can fix the timing problems without the iteration back to the logic design.

5 Physical Synthesis Flow  EC: identify high load gates, insert buffers, resize gate, …. Netlist Preparation Initial (timing-driven) Placement and Optimization Timing Analysis Electrical Correction Legalization  Cell overlaps (many buffers, many resized gates): −Move cells not too far −Big movements invalidates previous steps −Trend: rely on incremental mode: legal locations are found for cells when they are inserted

6 Physical Synthesis Flow (continued)  CPO: Can run with incremental STA and legalization to optimize specific nets Routing Critical Path Optimization Compression Constraint met?  Compression of remaining paths in the timing histogram Manual intervention And reiterate the flow

7 Gate Sizing  Needs multiple equivalent logic cells in the cell library −High performance, low power, minimum area  The tool can change equivalent cells after the placement to improve the timing or reduce the layout size or the power consumption.  Small equivalent cell sizes have less circuit device area and thus less power.  Can downsize the cells to reduce the power if the timing slack still keeps non-negative.

8 Buffer (Repeater) Insertion  The number of repeaters is expected to exceed 1 million in nano-scale VLSI systems  Huge number of repeaters also results in high power dissipation −IBM: 50% of leakage in inverters/buffers −Repeater insertion with minimum power subject to timing constraints has been investigated nm65nm45nm32nm %cells used as buffers [Saxena et al., TCAD ’04]

9 Buffer Model Buffer critical length (L crit )  The minimum net length above which inserting optimal sized and optimal-located buffer can reduce the delay compared to the unbuffered net [12].  At 45nm technology: L crit ≈ 235 micron sink source

10 Feasible Region feasible region (FR) for one buffer B given  a two-pin net  a delay constraint T req,  [x min, x max ] the maximum region where B can be located while still meeting the delay constraint. Jason Cong, “An Interconnect-Centric Design Flow for Nanometer Technologies,” Technical Report, 1999.

11 Feasible Region runit length wire resistance, cunit length wire capacitance, T b intrinsic delay for the buffer C b input capacitance of the buffer, R b output resistance of the buffer. R d Driver’s effective resistance. lwire length C L loading capacitance

12 Feasible Region  The distance of feasible region (y-axis) for inserting a buffer under different delay constraints (x-axis) for length 6mm to 9mm wires in the 0.18 micron technology x max -x min delay constraints

13 Two-Dimensional FR  When the route not specified: −  A 2D region −union of 1D feasible regions of all possible routes  Routing obstacles need to be deducted from the feasible region.

14 Obstacles  Buffers must be placed in layer 0 −  Require white space In Macrocell Design:  between macros,  suggested to design macros with holes inside[1]

15 Obstacles In Standard Cell Design:  Empty cells must be placed in placement stage.

16 FR for Multiple Buffers When multiple buffers needed to meet the delay constraint:  we can compute the FR of each buffer using a simple analytical formula (similar to above)  assuming that all other buffers are taking their optimal positions.  After a buffer is placed, we need to update the feasible regions of all other unplaced buffers of the same net to safely meet its delay constraint.

References Reference:  Alpert, Chu, Villarrubia, “The coming age of physical design,” ICCAD Further Reading:  Alpert, et al, “Techniques for fast physical synthesis,” Proc. of The IEEE, 95(3), March