1 A Tale of Two Nets: Studies in Wirelength Progression in Physical Design Andrew B. Kahng Sherief Reda CSE Department University of CA, San Diego.

Slides:



Advertisements
Similar presentations
Chuck Alpert Design Productivity Group Austin Research Laboratory
Advertisements

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.
MIP-based Detailed Placer for Mixed-size Circuits Shuai Li, Cheng-Kok Koh ECE, Purdue University {li263,
OCV-Aware Top-Level Clock Tree Optimization
Cadence Design Systems, Inc. Why Interconnect Prediction Doesn’t Work.
Optimization of Placement Solutions for Routability Wen-Hao Liu, Cheng-Kok Koh, and Yih-Lang Li DAC’13.
BSPlace: A BLE Swapping technique for placement Minsik Hong George Hwang Hemayamini Kurra Minjun Seo 1.
1 Interconnect Layout Optimization by Simultaneous Steiner Tree Construction and Buffer Insertion Presented By Cesare Ferri Takumi Okamoto, Jason Kong.
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.
Tanuj Jindal ∗, Charles J. Alpert‡, Jiang Hu ∗, Zhuo Li‡, Gi-Joon Nam‡, Charles B. Winn‡‡ ∗ Department of ECE, Texas A&M University, College Station, Texas.
Coupling-Aware Length-Ratio- Matching Routing for Capacitor Arrays in Analog Integrated Circuits Kuan-Hsien Ho, Hung-Chih Ou, Yao-Wen Chang and Hui-Fang.
FastPlace: Efficient Analytical Placement using Cell Shifting, Iterative Local Refinement and a Hybrid Net Model FastPlace: Efficient Analytical Placement.
Placer Suboptimality Evaluation Using Zero-Change Transformations Andrew B. Kahng Sherief Reda VLSI CAD lab UCSD ECE and CSE Departments.
Toward Better Wireload Models in the Presence of Obstacles* Chung-Kuan Cheng, Andrew B. Kahng, Bao Liu and Dirk Stroobandt† UC San Diego CSE Dept. †Ghent.
Intrinsic Shortest Path Length: A New, Accurate A Priori Wirelength Estimator Andrew B. KahngSherief Reda VLSI CAD Laboratory.
APLACE: A General and Extensible Large-Scale Placer Andrew B. KahngSherief Reda Qinke Wang VLSICAD lab University of CA, San Diego.
Boosting: Min-Cut Placement with Improved Signal Delay Andrew B. KahngSherief Reda CSE & ECE Departments University of CA, San Diego La Jolla, CA
International Conference on Computer-Aided Design San Jose, CA Nov. 2001ER UCLA UCLA 1 Congestion Reduction During Placement Based on Integer Programming.
38 th Design Automation Conference, Las Vegas, June 19, 2001 Creating and Exploiting Flexibility in Steiner Trees Elaheh Bozorgzadeh, Ryan Kastner, Majid.
Constructive Benchmarking for Placement David A. Papa EECS Department University of Michigan Ann Arbor, MI Igor L. Markov EECS.
On the Relevance of Wire Load Models Kenneth D. Boese, Cadence Design Systems, San Jose Andrew B. Kahng, UCSD CSE and ECE Depts., La Jolla Stefanus Mantik,
An Analytic Placer for Mixed-Size Placement and Timing-Driven Placement Andrew B. Kahng and Qinke Wang UCSD CSE Department {abk, Work.
Supply Voltage Degradation Aware Analytical Placement Andrew B. Kahng, Bao Liu and Qinke Wang UCSD CSE Department {abk, bliu,
Local Unidirectional Bias for Smooth Cutsize-delay Tradeoff in Performance-driven Partitioning Andrew B. Kahng and Xu Xu UCSD CSE and ECE Depts. Work supported.
Reconfigurable Computing (EN2911X, Fall07)
Placement Feedback: A Concept and Method for Better Min-Cut Placements Andrew B. KahngSherief Reda CSE & ECE Departments University of CA, San Diego La.
On Legalization of Row-Based Placements Andrew B. KahngSherief Reda CSE & ECE Departments University of CA, San Diego La Jolla, CA 92093
Measurement of Inherent Noise in EDA Tools Andrew B. Kahng* and Stefanus Mantik * UCSD CSE and ECE Departments, La Jolla, CA UCLA CS Department, Los Angeles,
University of Toronto Pre-Layout Estimation of Individual Wire Lengths Srinivas Bodapati (Univ. of Illinois) Farid N. Najm (Univ. of Toronto)
Can Recursive Bisection Alone Produce Routable Placements? Andrew E. Caldwell Andrew B. Kahng Igor L. Markov Supported by Cadence.
Estimation of Wirelength Reduction for λ-Geometry vs. Manhattan Placement and Routing H. Chen, C.-K. Cheng, A.B. Kahng, I. Mandoiu, and Q. Wang UCSD CSE.
Accurate Pseudo-Constructive Wirelength and Congestion Estimation Andrew B. Kahng, UCSD CSE and ECE Depts., La Jolla Xu Xu, UCSD CSE Dept., La Jolla Supported.
A Proposal for Routing-Based Timing-Driven Scan Chain Ordering Puneet Gupta 1 Andrew B. Kahng 1 Stefanus Mantik 2
ISPD 2000, San DiegoApr 10, Requirements for Models of Achievable Routing Andrew B. Kahng, UCLA Stefanus Mantik, UCLA Dirk Stroobandt, Ghent.
Interconnect Implications of Growth-Based Structural Models for VLSI Circuits* Chung-Kuan Cheng, Andrew B. Kahng and Bao Liu UC San Diego CSE Dept.
VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 5: Global Routing © KLMH Lienig 1 FLUTE: Fast Lookup Table Based RSMT Algorithm.
On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms National.
Are Floorplan Representations Important in Digital Design? H. H. Chan, S. N. Adya, I. L. Markov The University of Michigan.
Horizontal Benchmark Extension for Improved Assessment of Physical CAD Research Andrew B. Kahng, Hyein Lee and Jiajia Li UC San Diego VLSI CAD Laboratory.
TSV-Aware Analytical Placement for 3D IC Designs Meng-Kai Hsu, Yao-Wen Chang, and Valerity Balabanov GIEE and EE department of NTU DAC 2011.
March 20, 2007 ISPD An Effective Clustering Algorithm for Mixed-size Placement Jianhua Li, Laleh Behjat, and Jie Huang Jianhua Li, Laleh Behjat,
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.
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.
Thermal-aware Steiner Routing for 3D Stacked ICs M. Pathak and S.K. Lim Georgia Institute of Technology ICCAD 07.
-1- UC San Diego / VLSI CAD Laboratory Construction of Realistic Gate Sizing Benchmarks With Known Optimal Solutions Andrew B. Kahng, Seokhyeong Kang VLSI.
1/24/20071 ECO-system: Embracing the Change in Placement Jarrod A. Roy and Igor L. Markov University of Michigan at Ann Arbor.
ECO Timing Optimization Using Spare Cells Yen-Pin Chen, Jia-Wei Fang, and Yao-Wen Chang ICCAD2007, Pages ICCAD2007, Pages
Jason Cong‡†, Guojie Luo*†, Kalliopi Tsota‡, and Bingjun Xiao‡ ‡Computer Science Department, University of California, Los Angeles, USA *School of Electrical.
VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 6: Detailed Routing © KLMH Lienig 1 What Makes a Design Difficult to Route Charles.
Congestion Estimation and Localization in FPGAs: A Visual Tool for Interconnect Prediction David Yeager Darius Chiu Guy Lemieux The University of British.
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.
Chris Chu Iowa State University Yiu-Chung Wong Rio Design Automation
Routing Topology Algorithms Mustafa Ozdal 1. Introduction How to connect nets with multiple terminals? Net topologies needed before point-to-point routing.
FPGA CAD 10-MAR-2003.
International Symposium on Physical Design San Diego, CA April 2002ER UCLA UCLA 1 Routability Driven White Space Allocation for Fixed-Die Standard-Cell.
Zero Skew Clock Routing ECE 556 Project Proposal John Thompson Kurt Ting Simon Wong.
Fuzzy Logic Placement Emily Blem ECE556 Final Project December 14, 2004 Reference: E. Kang, R.B. Lin, and E. Shragowitz. “Fuzzy Logic Approach to VLSI.
Effective Linear Programming-Based Placement Techniques Sherief Reda UC San Diego Amit Chowdhary Intel Corporation.
Interconnect Characteristics of 2.5-D System Integration Scheme Yangdong (Steven) Deng & Wojciech P. Maly
C.A.D.: Bookshelf June 18, 8:00am-11:00am. Outline Review: [some of] bookshelf objectives Where we want to go vs what we have now Invited presentations.
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)
On the Relevance of Wire Load Models
Andrew B. Kahng and Xu Xu UCSD CSE and ECE Depts.
Revisiting and Bounding the Benefit From 3D Integration
APLACE: A General and Extensible Large-Scale Placer
A Semi-Persistent Clustering Technique for VLSI Circuit Placement
Reconfigurable Computing (EN2911X, Fall07)
Presentation transcript:

1 A Tale of Two Nets: Studies in Wirelength Progression in Physical Design Andrew B. Kahng Sherief Reda CSE Department University of CA, San Diego

2 This talk addresses two main questions Are our wirelength optimizations consistent across the physical design flow? How can we measure and report similarity of different placements?

3 Outline Motivation Definitions of consistency and similarity Empirical experiments: –Wirelength estimates vs HPWL –HPWL vs. Steiner length –Steiner length vs. routed length –The big picture Implications to physical design

4 The length of a net can have many values during the physical design flow Technical inability to find optimal solutions  Divide physical design into a number of suboptimal steps  Use a heuristic (at each step) to optimize a compromised objective instead of the ideal objective

5 1. How reasonable is it to optimize for a compromised objective? Logic synthesis optimizes estimates instead of routed wirelength Placement optimizes HPWL (or WWL) instead of routed wirelength Steiner tree construction methods optimizes individual nets Global routing versus detailed routing

6 2. How similar are our results if we use different tools / metrics? How different are results of the same tools? How different are results of different tools? Does it matter which estimate to use?  Similarity increases tool interporability and supports incremental changes

7 Outline Motivation Definitions of consistency and similarity Empirical experiments: –Wirelength estimates vs HPWL –HPWL vs. Steiner length –Steiner length vs. routed length –The big picture Implications to physical design

8 Ideal measuring of consistency is not technically feasible Place a design optimally according to HPWL and then route it optimally  WL 1 Simultaneously place and route a design optimally according to routed WL  WL 2 Consistency: How far is WL 1 from WL 2 ?

9 We indirectly measure consistency by tracing lengths of pairs of nets Pick a random pair of nets (i, j) with the same number of pins Trace their lengths during physical design Consistent optimization Inconsistent optimization Consistency = fraction of pairs of nets that their relative lengths do not change between two physical design stages Definition: If a and b are two stages: a pair of nets are consistent if and only if l a (i)  l a (j)  l b (i)  l b (j)

10 Achieving a consistency of 50% is trivial Given a netlist and its placement: –Let E be any set of estimate values randomly assigned to the nets –Let P be the lengths of the nets from the given placement Tracing relative lengths between E and P  on the average 50% of the time, pairs of nets would have the same relative lengths in both E and P

11 How much increase in consistency we can get if some tolerance is allowed? Definition: If a and b are two stages: a pair of nets are consistent with some tolerance tol if and only if l a (i)  l a (j)  l b (i)  l b (j) or  Consistency with tolerance allows us to tell whether small changes in wirelength are responsible for inconsistency

12 Placement is a means towards an end; similarity should be based on just WL Given two outputs q, p (placements / routings) and some net i: compare the length of i, l(i), between p and q Our notion of similarity satisfies three properties: [Alpert et al. ASPDAC’05] Reflexive: Symmetry: Triangle Inequality: Similarity

13 Outline Motivation Definitions of consistency and similarity Empirical experiments: –Wirelength estimates vs HPWL –HPWL vs. Steiner length –Steiner length vs. routed length –The big picture Implications to physical design

14 Let’s start measuring how consistent and similar our optimizations are Estimators: Mutual Contraction (MC) and Intrinsic Shortest Path Length (ISPL) Placers: Capo9.3 and APlace2.0 Steiner tree heuristics: FLUTE Routers: Cadence NanoRoute (V 4.10) Benchmarks: IBMV2 benchmarks (easy suite

15 Study Plan Estimate (ISPL/MC) HPWL (Capo/APlace) Steiner (FLUTE) Routing WL (nanoRoute) similarity consistency Big Picture

16 A grading system assigns grades to various consistency/similarity ranges Consistency / Similarity range Grade 90%-100%Excellent 80%-90%Very good 70%-80%Good 60%-70%Average 50%-60%Poor

17 Consistency between estimates and HPWL is average/poor MC versus HPWLISPL versus HPWL consistency (%) Using Capo

18 Consistency between estimates increases with increased tolerance

19 Consistency between HPWL and Steiner length is excellent circuit All nets Consistency Degree  4 nets ibm %96.24% ibm %96.83% ibm %97.60% ibm %97.32% ibm0999.9%96.60% ibm %97.35% ibm %97.27% ibm %75.35%

20 Consistency between Steiner length and routed wirelength is very good

21 Adding tolerance improves consistency between Steiner length and routed WL For ibm01 using Capo’s placement

22 How good are Weighted Wirelength Objectives? From Capo’s placement: Pick two nets i and j with the same HPWL and number of pins (  4) Calculate Steiner length t(i) and t(j) for both i and j Ideally, according to WWL, t(i) = t(j) Define skew=max(t(i), t(j))/min(t(i), t(j)) Let’s look at the fraction of nets p(x) with skew between [1…x]

23 Skew in Steiner lengths between nets with the same HPWL and #pins Most nets ~85% are just within skew < 2

24 The big picture: consistency across more than two consecutive stages HPWLSteinerRouted WL EstimatePoor/averagePoor HPWL-ExcellentVery good / good Steiner--Very good

25 Placements of the same placer or different placers share little similarity APlace vs Capo Capo vs Capo APlace vs APlace ibm %64.61%71.17% ibm %65.10%79.34% ibm %59.79%68.95% Ibm %61.93%65.31% Ibm %61.54%62.46% ibm %64.49%67.56% ibm %60.95%64.83% ibm %61.25%69.83%

26 Similarity between different routing results of different placers is poor

27 Outline Motivation Definitions of consistency and similarity Empirical experiments: –Wirelength estimates vs HPWL –HPWL vs. Steiner length –Steiner length vs. routed length –The big picture Implications to physical design

28 Implications to a priori WL estimators Do not trust individual a priori WL estimators with every net  have poor consistency with WL Relay on a priori estimators to predict long interconnects [KahngR05 - ICCAD’05] Aggregating individual estimates smooth out variations and can successfully predict total WL [KahngR05 - ICCAD’05]  Please more work in the area of a priori wirelength estimation

29 Implication to placers Continue using HPWL as an optimization objective  excellent consistency with Steiner length Find better ways to integrate routing into placement Find ways to make placements more similar (at least from the same placer)

30 Implications to Steiner length and routers WWL sometimes has slight discrepancies Focusing on individual Steiner lengths as a way for improving routing results might not be the best strategy Integration of placement and global routing should be standard

31 Questions / Answers

32 Definitions A priori: predicting HPWL before placement just by looking at the netlist Stability = similarity (as defined in slide 12) Consistency (defined in slides 9-10) WWL = weight factors for HPWL based on lookup tables indexed by the number of pins and HPWL of nets. They approximate Steiner length

33 How do you explain that APlace’s has little similarity? APlace uses an initial random placement around the center to establish the gradients. This placement changes when the random seed changes How do you explain that estimates give us poor results? We have found a little similarity (~65%) between own placer results. How can we expect something better from estimates? Why do you think GI can be well predicted with estimators? ISPL in particular can well detect GIs, because these interconnects tend to be quite structurally separated at the netlist Questions and Answers:

34 What are the unexpected data into your studies? We are surprised by how there is very poor consistency between a priori estimates and routed WL. We are surprised by excellent consistency between HPWL and Steiner length. I would say our focus should be improving the consistency between Steiner length and routing WL. If this would have been a perfect paper, what do you like to see? I would like to see comparisons of different routers and of results of the same router. Perhaps I would also like to see how consistency between HPWL and routing changes if whitespace (WS) changes. WS increase is likely to improve consistency. I am also interested in seeing what would be the similarity of placements produced from industrial placers, since these tend to be more stable especially to support ECO changes. I am also looking to study the consistency between Steiner WL and routed WL of a Steiner-tree driven placer Questions and Answers: