1/24/20071 ECO-system: Embracing the Change in Placement Jarrod A. Roy and Igor L. Markov University of Michigan at Ann Arbor.

Slides:



Advertisements
Similar presentations
Capo: Robust and Scalable Open-Source Min-cut Floorplacer Jarrod A. Roy, David A. Papa,Saurabh N. Adya, Hayward H. Chan, James F. Lu, Aaron N. Ng, Igor.
Advertisements

OCV-Aware Top-Level Clock Tree Optimization
Optimization of Placement Solutions for Routability Wen-Hao Liu, Cheng-Kok Koh, and Yih-Lang Li DAC’13.
Xing Wei, Wai-Chung Tang, Yu-Liang Wu Department of Computer Science and Engineering The Chinese University of HongKong
X-Architecture Placement Based on Effective Wire Models Tung-Chieh Chen, Yi-Lin Chuang, and Yao-Wen Chang Graduate Institute of Electronics Engineering.
Meng-Kai Hsu, Sheng Chou, Tzu-Hen Lin, and Yao-Wen Chang Electronics Engineering, National Taiwan University Routability Driven Analytical Placement for.
A Size Scaling Approach for Mixed-size Placement Kalliopi Tsota, Cheng-Kok Koh, Venkataramanan Balakrishnan School of Electrical and Computer Engineering.
Shuai Li and Cheng-Kok Koh School of Electrical and Computer Engineering, Purdue University West Lafayette, IN, Mixed Integer Programming Models.
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.
SimPL: An Effective Placement Algorithm Myung-Chul Kim, Dong-Jin Lee and Igor L. Markov Dept. of EECS, University of Michigan 1ICCAD 2010, Myung-Chul Kim,
1 Physical Hierarchy Generation with Routing Congestion Control Chin-Chih Chang *, Jason Cong *, Zhigang (David) Pan +, and Xin Yuan * * UCLA Computer.
Chop-SPICE: An Efficient SPICE Simulation Technique For Buffered RC Trees Myung-Chul Kim, Dong-Jin Lee and Igor L. Markov Dept. of EECS, University of.
Consistent Placement of Macro-Blocks Using Floorplanning and Standard-Cell Placement Saurabh Adya Igor Markov (University of Michigan)
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.
Boosting: Min-Cut Placement with Improved Signal Delay Andrew B. KahngSherief Reda CSE & ECE Departments University of CA, San Diego La Jolla, CA
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.
Faster SAT and Smaller BDDs via Common Function Structure Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah University of Michigan.
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.
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
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.
Can Recursive Bisection Alone Produce Routable Placements? Andrew E. Caldwell Andrew B. Kahng Igor L. Markov Supported by Cadence.
A Proposal for Routing-Based Timing-Driven Scan Chain Ordering Puneet Gupta 1 Andrew B. Kahng 1 Stefanus Mantik 2
Processing Rate Optimization by Sequential System Floorplanning Jia Wang 1, Ping-Chih Wu 2, and Hai Zhou 1 1 Electrical Engineering & Computer Science.
A Resource-level Parallel Approach for Global-routing-based Routing Congestion Estimation and a Method to Quantify Estimation Accuracy Wen-Hao Liu, Zhen-Yu.
Placement-Centered Research Directions and New Problems Xiaojian Yang Amir Farrahi Synplicity Inc.
Chip Planning 1. Introduction Chip Planning:  Deals with large modules with −known areas −fixed/changeable shapes −(possibly fixed locations for some.
© R.A. Rutenbar 2005 Early Research Experience With OpenAccess Gear : An Open Source Development Environment For Physical Design Zhong Xiu*, David A. Papa.
CRISP: Congestion Reduction by Iterated Spreading during Placement Jarrod A. Roy†‡, Natarajan Viswanathan‡, Gi-Joon Nam‡, Charles J. Alpert‡ and Igor L.
Global Routing.
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.
Solving Hard Instances of FPGA Routing with a Congestion-Optimal Restrained-Norm Path Search Space Keith So School of Computer Science and Engineering.
March 20, 2007 ISPD An Effective Clustering Algorithm for Mixed-size Placement Jianhua Li, Laleh Behjat, and Jie Huang Jianhua Li, Laleh Behjat,
VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 5: Global Routing © KLMH Lienig 1 EECS 527 Paper Presentation High-Performance.
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.
Efficient Multi-Layer Obstacle- Avoiding Rectilinear Steiner Tree Construction Chung-Wei Lin, Shih-Lun Huang, Kai-Chi Hsu,Meng-Xiang Li, Yao-Wen Chang.
Analytic Placement. Layout Project:  Sending the RTL file: −Thursday, 27 Farvardin  Final deadline: −Tuesday, 22 Ordibehesht  New Project: −Soon 2.
Massachusetts Institute of Technology 1 L14 – Physical Design Spring 2007 Ajay Joshi.
Placement. Physical Design Cycle Partitioning Placement/ Floorplanning Placement/ Floorplanning Routing Break the circuit up into smaller segments Place.
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.
Recursive Bisection Placement*: feng shui 5.0 Ameya R. Agnihotri Satoshi Ono Patrick H. Madden SUNY Binghamton CSD, FAIS, University of Kitakyushu (with.
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.
Quadratic VLSI Placement Manolis Pantelias. General Various types of VLSI placement  Simulated-Annealing  Quadratic or Force-Directed  Min-Cut  Nonlinear.
I N V E N T I V EI N V E N T I V E A Morphing Approach To Address Placement Stability Philip Chong Christian Szegedy.
Physical Synthesis Comes of Age Chuck Alpert, IBM Corp. Chris Chu, Iowa State University Paul Villarrubia, IBM Corp.
Analytical Minimization of Signal Delay in VLSI Placement Andrew B. Kahng and Igor L. Markov UCSD, Univ. of Michigan
Dec 1, 2003 Slide 1 Copyright, © Zenasis Technologies, Inc. Flex-Cell Optimization A Paradigm Shift in High-Performance Cell-Based Design A.
Optimality, Scalability and Stability study of Partitioning and Placement Algorithms Jason Cong, Michail Romesis, Min Xie UCLA Computer Science Department.
Physical Synthesis Buffer Insertion, Gate Sizing, Wire Sizing,
1 NTUplace: A Partitioning Based Placement Algorithm for Large-Scale Designs Tung-Chieh Chen 1, Tien-Chang Hsu 1, Zhe-Wei Jiang 1, and Yao-Wen Chang 1,2.
1ISPD'03 Process Variation Aware Clock Tree Routing Bing Lu Cadence Jiang Hu Texas A&M Univ Gary Ellis IBM Corp Haihua Su IBM Corp.
High-Performance Global Routing with Fast Overflow Reduction Huang-Yu Chen, Chin-Hsiung Hsu, and Yao-Wen Chang National Taiwan University Taiwan.
International Symposium on Physical Design San Diego, CA April 2002ER UCLA UCLA 1 Routability Driven White Space Allocation for Fixed-Die Standard-Cell.
An Exact Algorithm for Difficult Detailed Routing Problems Kolja Sulimma Wolfgang Kunz J. W.-Goethe Universität Frankfurt.
Effective Linear Programming-Based Placement Techniques Sherief Reda UC San Diego Amit Chowdhary Intel Corporation.
Hypergraph Partitioning With Fixed Vertices Andrew E. Caldwell, Andrew B. Kahng and Igor L. Markov UCLA Computer Science Department
Interconnect Characteristics of 2.5-D System Integration Scheme Yangdong (Steven) Deng & Wojciech P. Maly
A Snap-On Placement Tool Israel Waldman. Introduction.
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.
HeAP: Heterogeneous Analytical Placement for FPGAs
EE5780 Advanced VLSI Computer-Aided Design
Reinventing The Wheel: Developing a New Standard-Cell Synthesis Flow
Reinventing The Wheel: Developing a New Standard-Cell Synthesis Flow
Presentation transcript:

1/24/20071 ECO-system: Embracing the Change in Placement Jarrod A. Roy and Igor L. Markov University of Michigan at Ann Arbor

1/24/20072 Cong and Sarrafzadeh: state-of-the-art incremental placement techniques “unfocused and incomplete” (ISPD 2000) Kahng and Mantik: CAD tools “may not be correctly designed for ECO-dominated design processes” (ICCAD 2000) Cadence CTO Ted Vucurevich: need “re-entrant, heterogeneous, incremental, and hierarchical” tools for next-generation designs (ISPD 2006 keynote) Synplicity CTO Ken McElvain: “Our focus in this flow is to produce similar output for small design changes, …” (EE Times, Jan. 16, 2007) Motivation

1/24/20073 Limitations of Prior Work Instead of preserving design metrics, seeks to preserve geometry  Seeks minimum movement (ISPD’05)  Seeks to preserve relative ordering (DAC’05, ICCAD’05)  Cannot place new logic  Cannot accommodate dramatic changes Assume generous whitespace  In dense regions, cell-reordering dominates cell-shifting If not the legalizer, the detail placer will reorder cells  Fixed obstacles complicate cell-shifting  Handling of chunky macros becomes difficult Puzzle-solving cannot be performed with PDEs or non-linear optimization

1/24/20074 APlace 2.04 Global

1/24/20075 Connecting global and detail placement  Analytical placers produce significant overlap, cells do not align to site and row boundaries Physical Synthesis  Buffering, sizing and resynthesis require legalization  “Safe Delay Optimization for Physical Synthesis”, K.-H. Chang et al., in session 6C High-level Synthesis  Restructuring multipliers  Adding new IP blocks Functional bug-fixing and other modifications  “Fixing Design Errors with Counterexamples and Resynthesis”, K.-H. Chang et al., in session 9C Contexts for ECO Placement

1/24/20076 Requirements for ECO Placement Changing cell dimensions Updating net weights/criticalities Adding/Removing various constraints:  Density (to promote routability)  Regions (to address timing) Adding/Removing nets Adding cells or macros  With or w/o initial locations Adding/Moving obstacles  Memories, IP blocks, RTL macros, etc.

1/24/20077 Illustration 1: Moving a Macro

1/24/20078 Illustration 2: Adding a New Macro

1/24/20079 Zooms in on regions that require change Applies adequate effort  Is capable of replacing whole regions  Can call a black-box global placer in regions  Can legalize even dramatic overlap  Can handle new logic modules, new obstacles Handles macros and fixed obstacles natively Includes all detail placement from Capo Our Solution: ECO-system

1/24/ ECO-system in Action

1/24/ ECO-system Flow Start with existing placmnt, proceed top-down Partition layout, not netlist  Unlike min-cut placers Fast geometric sweep  Minimize net-cut  Linear time, next slide Check quality of partitioning  Also linear time If cut-line bad or illegal, replace region from scratch Details in proceedings

1/24/ Linear-time Cut-line Selection Proceed left to right (or bottom to top) Maintain area and net-cut per cut-line Choose balanced cut-line with least cut Runs in linear time w.r.t. # of pins Potential Vertical Cut-lines

1/24/ Evaluating a Partition A geometric cut-line and a placement determine a netlist partition  E.g., for a min-cut placement this may be an original placement found by hgraph partitioner  We make no assumptions about the placement We can either accept or reject a partition  Accept: the above algorithm continues  Reject: region is replaced from scratch using any placer Rejection criterion  If (best found) partition is unbalanced, then reject  Run a single pass of Fidducia-Mattheyses (linear time)  If cut improvement >90%, then reject (tolerance represents aggressiveness)  If several additional checks pass, then accept

1/24/ Interface with High-level and Physical Synthesis Additional user controls  Specify areas for refinement  Tune ECO-system’s aggressiveness  Update net weights for TD placement  Redistribute whitespace Placing new cells and macros  With or without initial locations

1/24/ Experimental Results ECO-system tested in several contexts  Cell resizing  Legalization of analytical global placements  Improving routability Tested on a wide range of publicly available benchmark suites  ISPD’02 IBMv2 benchmarks  ICCAD’04 IBM-MixedSizewPins benchmarks  ICCAD’04 Faraday benchmarks  ISPD’05 placement contest benchmarks  IWLS’05 OpenCores benchmarks

1/24/ Cell Resizing Experiments Experiment 1  Start with Capo placements of IBM-MixedSizewPins benchmarks  Randomly resize each cell but maintain total area  Compare ECO-system with Capo 10 legalizer Experiment 2  Start with APlace placements of ISPD’05 benchmarks  Randomly resize each cell but maintain total area  Compare ECO-system with Capo 10 legalizer Experiment 3  Start with Capo placements of IWLS’05 benchmarks  Resize standard cells based on wire load  Upsize cells that drive longer wires according to fixed delay methodology  Compare ECO-system with Capo 10 legalizer

1/24/ Placed by APlace 2.04 ECO- system reduces HPWL 2% Average displacement 0.28% of core semi-perimeter, 10x smaller than previous work Resizing on ISPD’05

1/24/ Cell Resizing: Results Experiment 1: IBM-MSwPins benchmarks  Capo 10 legalizer takes 1% original place time, increases HPWL by 3.93%  ECO-system takes 16% original place time, increases HPWL by 0.61% Experiment 2: ISPD’05 benchmarks  Capo 10: 4% place time, increases HPWL 4.28%  ECO-system: 12% place time, decreases HPWL 1.00% Experiment 3: IWLS’05 benchmarks  Capo 10: negligible runtime, increases HPWL 1.85%  ECO-system: 6% place time, decreases HPWL 1.81%

1/24/ ECO-system’s Impact on Timing Measure timing before and after ECO-system on resized IWLS’05 BMs  Timer uses D2M delay model with FLUTE Steiner trees ECO-system largely preserves timing  On average, critical path delay changes 1%  Worst case increases delay 8.07%  Best case decreases delay 7.37% Results not specific to our STA engine  In this experiment ECO-system is completely independent of timer  Average cell movement <1%, therefore most design metrics should be largely unchanged Using STA in ECO-system can further improve results

1/24/ Run APlace 2.04 on ISPD’05 benchmarks  Save global placements (overlap 28-47% by area)  Save final placements Legalize global placements using ECO-system  Compare the two sets of final placements Empirical results:  APlace legalizer increases HPWL 4.91%  ECO-system increases HPWL 3.68%, runs 3x faster than APlace legalizer Experiments with Legalization of Analytical Global Placements

1/24/ Routability Improvements Place IBMv2 benchmarks with mPL6  Save global placements  Save final placements Legalize global placements using ECO-system Route two sets of final placements with Cadence WarpRoute  Compare final routed designs Empirical results:  ECO-system placements route without violation  ECO-system reduces routed wirelength by 1.1%, vias by 7.8% and routing time by 50%

1/24/ Place Faraday (ICCAD’04) benchmarks with mPL6  Design “dma” omitted as it’s obstacle-free  Save global placements  Save final placements Legalize global placements using ECO-system Route two sets of final placements with Cadence WarpRoute  Compare final routed designs  mPL6’s detail placer is XDP (ASPDAC’06) Routability with Fixed Obstacles

1/24/ ECO-system: A robust and efficient placement recycler  Preserves the original placement but has the power to replace from scratch  Outperforms other incremental tools in runtime, HPWL and routability  Minimal impact on timing ECO-system provides reliable legalization with the ability to replace regions from scratch  Can resort to full-fledged placement  Lowers the barriers to research in global placement and physical synthesis ECO-system is included in Capo 10.5  Free for all uses  Conclusions