TimberWolf 7.0 Placement Perform TimberWolf placement

Slides:



Advertisements
Similar presentations
6.5 Graphing Linear Inequalities
Advertisements

A Minimum Cost Path Search Algorithm Through Tile Obstacles Zhaoyun Xing and Russell Kao Sun Microsystems Laboratories.
Write equation or Describe Transformation. Write the effect on the graph of the parent function down 1 unit1 2 3 Stretch by a factor of 2 right 1 unit.
Ripple: An Effective Routability-Driven Placer by Iterative Cell Movement Xu He, Tao Huang, Linfu Xiao, Haitong Tian, Guxin Cui and Evangeline F.Y. Young.
Optimization of a FEA Beam Element Model for Computational Speed and Accuracy Brent Weight and Ryan Weight.
Floorplanning. Obtained by subdividing a given rectangle into smaller rectangles. Each smaller rectangle corresponds to a module.

VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 5: Global Routing © KLMH Lienig 1 FLUTE: Fast Lookup Table Based RSMT Algorithm.
Graphing Piecewise Functions
Authors: Jia-Wei Fang,Chin-Hsiung Hsu,and Yao-Wen Chang DAC 2007 speaker: sheng yi An Integer Linear Programming Based Routing Algorithm for Flip-Chip.
Seeing the Forest and the Trees: Steiner Wirelength Optimization in Placement Jarrod A. Roy, James F. Lu and Igor L. Markov University of Michigan Ann.
1 Wire Length Prediction-based Technology Mapping and Fanout Optimization Qinghua Liu Malgorzata Marek-Sadowska VLSI Design Automation Lab UC-Santa Barbara.
computer
Algebra II w/ trig. A. Greatest Integer function (Step Function): greatest integer less than or equal to x 1. =2. = 3. =4. = 5. =6. =
Massachusetts Institute of Technology 1 L14 – Physical Design Spring 2007 Ajay Joshi.
Congestion Estimation and Localization in FPGAs: A Visual Tool for Interconnect Prediction David Yeager Darius Chiu Guy Lemieux The University of British.
§ 1.2 Graphing Linear Equations. Martin-Gay, Beginning and Intermediate Algebra, 4ed 22 Linear Equation in Two Variables A linear equation in two variables.
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
1-Steiner Algorithm (1/17)Practical Problems in VLSI Physical Design 1-Steiner Routing by Kahng/Robins Perform 1-Steiner Routing by Kahng/Robins  Need.
Notes Over 2.3 The Graph of a Function Finding the Domain and Range of a Function. 1.Use the graph of the function f to find the domain of f. 2.Find the.
5-2 Polynomials, Linear Factors, & Zeros
x y Example 1 x y X = 3.
2.7 Piecewise Functions p In real life functions are represented by a combination of equations, each corresponding to a part of the domain. These.
2.2 day 3 The Piecewise Function
Notes Over 3.1 Solving a System Graphically Graph the linear system and estimate the solution. Then check the solution algebraically.
CHAPTER TWO: LINEAR EQUATIONS AND FUNCTIONS ALGEBRA TWO Section Piecewise Functions.
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.
Mincut Placement (1/12)Practical Problems in VLSI Physical Design Mincut Placement Perform quadrature mincut onto 4 × 4 grid  Start with vertical cut.
Copyright 2013, 2010, 2007, 2005, Pearson, Education, Inc.
§ 1.3 Intercepts.
5-2 Polynomials, Linear Factors, & Zeros
Linear Equation in Two Variables
Linear Inequalities in Two Variables
Graphing Technique; Transformations
1.8 Graphing Linear Inequalities
What piecewise function represents the graph?
Piecewise Functions.
VLSI Quadratic Placement
Topic 8-3 Polynomials, Linear Factors & Zeros
FlowMap Algorithm Perform clustering on the following 2-bounded network Intra-cluster and node delay = 0, inter-cluster = 1 Pin constraint = 3 Practical.
Algebra: Equations and Inequalities
Sequence Pair Representation
By Santhosh Reddy Katkoori
Iterative Deletion Routing Algorithm
GORDIAN Placement Perform GORDIAN placement
2.4 Linear Functions: Graphs and Slope
1.) Algebra 2/Trigonometry Name: ________________
A-tree Routing Algorithm
Bounded Radius Routing
1.1 – Limits: A Numerical and Graphical Approach
EE5780 Advanced VLSI Computer-Aided Design
Multi-level Coarsening Algorithm
Network Flow-based Bipartitioning
Lecture 3 VLSI Physical Design VLSI design flow VLSI physical design
Graphs of Linear Inequalities
L-Shaped RST Routing Perform L-RST using node b as the root
Piecewise-Defined Function
Steiner Min/Max Tree Routing
Unit 1 Representing Real Numbers
§ 8.3 Graphing Piecewise-Defined Functions and Shifting and Reflecting Graphs of Functions.
Y x
3 Chapter Chapter 2 Graphing.
3 Chapter Chapter 2 Graphing.
Determining the Function Obtained from a Series of Transformations.
35 – Local Linearization No Calculator
How do horizontal bar graphs differ from vertical bar graphs?
2-8: Two Variable Inequalities
Line Graphs.
Parallelized Analytic Placer
FLUTE: Fast Lookup Table Based RSMT Algorithm for VLSI Design
Presentation transcript:

TimberWolf 7.0 Placement Perform TimberWolf placement Based on the given standard cell placement Initial HPBB wirelength = 23 Practical Problems in VLSI Physical Design

First Swap Swap node b and e We shift node h: on the shorter side of the receiving row Node b included in nets {n3, n9}, and e in {n1, n7} Practical Problems in VLSI Physical Design

Computing ΔW ΔW = wirelength change from swap Practical Problems in VLSI Physical Design

Estimating ΔWs ΔWs = wirelength change from shifting h is shifted and included in n4 = {d,h,i} and n7 ={c,e,f,h,n} h is on the right boundary of n4: gradient(h)++ h is not on any boundary of n7: no further change on gradient(h) Practical Problems in VLSI Physical Design

Estimating ΔWs (cont) Practical Problems in VLSI Physical Design

Accuracy of ΔWs Estimation How accurate is ΔWs estimation? Node h is included in n4 = {d,h,i} and n7 ={c,e,f,h,n} Real change is also 1: accurate estimation Practical Problems in VLSI Physical Design

Estimation Model B Based on piecewise linear graph Shifting h causes the wirelength of n4 to increase by 1 (19 to 20) and no change on n7 (stay at 28) Practical Problems in VLSI Physical Design

Second Swap Swap node m and o We shift node d and g: on the shorter side of the receiving row Node m included in nets {n5, n9}, and o in {n2, n10} Practical Problems in VLSI Physical Design

Computing ΔW ΔW = wirelength change from swap Practical Problems in VLSI Physical Design

Estimating ΔWs Cell d and g are shifted d is included in n4 = {d,h,i}, n6 ={d,k,j}, and n8 ={d,l} d is on the right boundary of n6 and n8 So, gradient(d) = 2 Practical Problems in VLSI Physical Design

Estimating ΔWs (cont) Cell d and g are shifted g is included in n1 = {a,e,g}, and n9 ={b,g,i,m} g is on the right boundary of n1 and n9 So, gradient(g) = 2 Practical Problems in VLSI Physical Design

Estimating ΔWs (cont) Practical Problems in VLSI Physical Design

Third Swap Swap node k and m We shift node c: on the shorter side of the receiving row Node k included in nets {n3, n6 , n10}, and m in {n5, n9} Practical Problems in VLSI Physical Design

Computing ΔW ΔW = wirelength change from swap Practical Problems in VLSI Physical Design

Estimating ΔWs Cell c is shifted c is included in n3 = {b,c,k,n} and n7 ={c,e,f,h,n} c is on the left boundary of n3 So, gradient(c) = −1 Practical Problems in VLSI Physical Design

Estimating ΔWs (cont) Practical Problems in VLSI Physical Design