Consistent Placement of Macro-Blocks Using Floorplanning and Standard-Cell Placement Saurabh Adya Igor Markov (University of Michigan)

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

An Effective Floorplanning Algorithm in Mixed Mode Placement Integrated with Rectilinear- Shaped Optimization for Soft Blocks Changqi Yang, Xianlong Hong,
Natarajan Viswanathan Min Pan Chris Chu Iowa State University International Symposium on Physical Design April 6, 2005 FastPlace: An Analytical Placer.
X-Architecture Placement Based on Effective Wire Models Tung-Chieh Chen, Yi-Lin Chuang, and Yao-Wen Chang Graduate Institute of Electronics Engineering.
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.
FastPlace: Efficient Analytical Placement using Cell Shifting, Iterative Local Refinement and a Hybrid Net Model FastPlace: Efficient Analytical Placement.
Early Days of Circuit Placement Martin D. F. Wong Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
Placer Suboptimality Evaluation Using Zero-Change Transformations Andrew B. Kahng Sherief Reda VLSI CAD lab UCSD ECE and CSE Departments.
Routability-Driven Blockage-Aware Macro Placement Yi-Fang Chen, Chau-Chin Huang, Chien-Hsiung Chiou, Yao-Wen Chang, Chang-Jen Wang.
March 2002 update for GSRC Igor L. Markov University of Michigan.
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.
Fixed-outline Floorplanning Through Better Local Search
Implementation and Extensibility of an Analytic Placer Andrew B. Kahng and Qinke Wang UCSD CSE Department {abk, Work partially supported.
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.
An Algebraic Multigrid Solver for Analytical Placement With Layout Based Clustering Hongyu Chen, Chung-Kuan Cheng, Andrew B. Kahng, Bo Yao, Zhengyong Zhu.
Fixed-outline Floorplanner (Parquet) A constraint satisfaction problem “Parquet” based on “floorplan slack” Use better local search to satisfy constraints.
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.
Processing Rate Optimization by Sequential System Floorplanning Jia Wang 1, Ping-Chih Wu 2, and Hai Zhou 1 1 Electrical Engineering & Computer Science.
Triple Patterning Aware Detailed Placement With Constrained Pattern Assignment Haitong Tian, Yuelin Du, Hongbo Zhang, Zigang Xiao, Martin D.F. Wong.
Floorplacement Igor L. Markov. Floorplacement (the term was coined by Steve Teig of Simplex/Cadence in 2002)
Placement-Centered Research Directions and New Problems Xiaojian Yang Amir Farrahi Synplicity Inc.
VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 3: Chip Planning © KLMH Lienig 1 Modern Floorplanning Based on B*-Tree and Fast.
Placement by Simulated Annealing. Simulated Annealing  Simulates annealing process for placement  Initial placement −Random positions  Perturb by block.
VLSI Physical Design Automation
Are Floorplan Representations Important in Digital Design? H. H. Chan, S. N. Adya, I. L. Markov The University of Michigan.
1 Modern Floorplanning Based on Fast Simulated Annealing Tung-Chieh Chen* and Yao-Wen Chang* # Graduate Institute of Electronics Engineering* Department.
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.
10/11/ VLSI Physical Design Automation Prof. David Pan Office: ACES Placement (2)
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.
Analytic Placement. Layout Project:  Sending the RTL file: −Thursday, 27 Farvardin  Final deadline: −Tuesday, 22 Ordibehesht  New Project: −Soon 2.
Improved Cut Sequences for Partitioning Based Placement Mehmet Can YILDIZ and Patrick H. Madden State University of New York at BinghamtonComputer Science.
Regularity-Constrained Floorplanning for Multi-Core Processors Xi Chen and Jiang Hu (Department of ECE Texas A&M University), Ning Xu (College of CST Wuhan.
Massachusetts Institute of Technology 1 L14 – Physical Design Spring 2007 Ajay Joshi.
1/24/20071 ECO-system: Embracing the Change in Placement Jarrod A. Roy and Igor L. Markov University of Michigan at Ann Arbor.
Placement. Physical Design Cycle Partitioning Placement/ Floorplanning Placement/ Floorplanning Routing Break the circuit up into smaller segments Place.
Deferred Decision Making Enabled Fixed- Outline Floorplanner Jackey Z. Yan and Chris Chu DAC 2008.
Quadratic VLSI Placement Manolis Pantelias. General Various types of VLSI placement  Simulated-Annealing  Quadratic or Force-Directed  Min-Cut  Nonlinear.
A Stable Fixed-outline Floorplanning Method Song Chen and Takeshi Yoshimura Graduate School of IPS, Waseda University March, 2007.
Analytical Minimization of Signal Delay in VLSI Placement Andrew B. Kahng and Igor L. Markov UCSD, Univ. of Michigan
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.
Unified Quadratic Programming Approach for Mixed Mode Placement Bo Yao, Hongyu Chen, Chung-Kuan Cheng, Nan-Chi Chou*, Lung-Tien Liu*, Peter Suaris* CSE.
Unification of VLSI Placement and Floorplanning
Outline Motivation and Contributions Related Works ILP Formulation
International Symposium on Physical Design San Diego, CA April 2002ER UCLA UCLA 1 Routability Driven White Space Allocation for Fixed-Die Standard-Cell.
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
The Early Days of Automatic Floorplan Design
1 Double-Patterning Aware DSA Template Guided Cut Redistribution for Advanced 1-D Gridded Designs Zhi-Wen Lin and Yao-Wen Chang National Taiwan University.
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.
Constrained ‘Modern’ Floorplanning
Partial Reconfigurable Designs
Andrew B. Kahng and Xu Xu UCSD CSE and ECE Depts.
APLACE: A General and Extensible Large-Scale Placer
Sheqin Dong, Song Chen, Xianlong Hong EDA Lab., Tsinghua Univ. Beijing
EE5780 Advanced VLSI Computer-Aided Design
EDA Lab., Tsinghua University
ICCAD-2002 Open Source Panel Andrew B
Presentation transcript:

Consistent Placement of Macro-Blocks Using Floorplanning and Standard-Cell Placement Saurabh Adya Igor Markov (University of Michigan)

Outline Motivations for mixed-mode placement Previous Work Components of our flow –Fixed-outline floorplanning –Standard-Cell placement Mixed-mode placement flow New Benchmarks Results Conclusions

Motivation IP reuse : PD with large rectangular blocks Integrated partitioning, FP & placement –Older flows apply separate optimizations –New generation of fast (min-cut) placers enable an integrated approach Partitioner is part of the placer Shifted cutlines perform floorplanning However handling large macros by RB is difficult –Small macros can be handled by RB (not in our work) Capo, Dragon, Feng Shui, etc. – can’t place large macros w/o overlaps

Previous Work Continuous optimization techniques –Force directed approaches [Eisenmann, Johannes, DAC ‘98] : mixed-mode [Mo et. al, ICCAD ‘00] : macros only + congestion –Are good with a lot of white-space in design –Otherwise, designer must remove overlaps Combinatorial optimization techniques –Particularly promising on constrained designs –[Nag et. al, DATE ‘98]: macros only –This work: mixed-mode

Cadence-recommended Mixed-Mode Flow for SEDSM 1.SEDSM places blocks at the periphery 2.Designer manually removes overlaps 3.From now on, blocks are considered fixed 4.QPlace is called to place standard-cells Otherwise, as our experiments show, –Handling many large cells is not ideal in QPlace Next-gen Cadence mixed-mode layout tool –In  -testing –Preliminary results are good

SEDSM Output (not new gen!)

Our Proposed Flow (Outline) 1.Generate initial placement using an arbitrary, min-WL standard-cell placer 2.Generate a fixed-outline floorplanning instance by “physical clustering” 3.Remove overlaps and generate valid macro locations using a fixed-outline floorplanner 4.Place small cells using standard-cell placer with macros considered fixed  (details – later)

Component : 1 Fast min-cut std-cell placer (Capo) – [Caldwell, Kahng and Markov, DAC 2000] Algorithms used –Min-cut bisection, optimal end-case placers –Multi-level FM partitioning –Cut-lines allowed to move, adaptive part. toler. Yet, Capo does not handle large macros So on

Component : 2 Fixed-outline floorplanner (Parquet) –[Adya and Markov, ICCD 2001] Solves a constraint satisfaction problem while minimizing wirelength Uses enhanced local search during annealing to satisfy outline constraints y-span  x-span 

Floorplan “Slack” Slack for block A in x- or y- dimension –The distance that A can be moved in x- or y- dimension without increasing the x- or y- span “Critical” blocks have zero slack Critical blocks lie on critical paths: analogy w STA We want to move critical blocks to improve fplan F E D A B C Left Packing Right Packing x- slack for block A = x(A right ) – x(A left ) A C B D E F critical blocks

Fixed-outline FP’er Parquet (based on Simulated Annealing) S.A. x-violation y-violation current outline required outline   Restart S.A.

In This Work: Improvements to Parquet HPWL minimization –Local annealing objective = linear combination of area and wirelength –Additional moves designed to improve HPWL Handling soft blocks –X/Y slacks suggest changes to AR of a block –At regular intervals during annealing Sort blocks according to slacks Shape blocks as suggested by the slacks Try to greedily reshape every soft blocks

Mixed-mode Placement Flow (1) Find a tentative placement of macros –Shred macros into fake standard-cells –Connect sub-cells with fake wires (pics follow) –Place “shredded netlist’’ using Capo –Compute locs of macros as average locs of sub-cells (continued later)

Shredding Macro Cells Shred all macros into smaller sub-cells Determine location of macros by averaging locations of sub-cells Determine the prevailing orientation of each macro (Should work with many min-WL placers) VaVa VrVr Case: Orient Va Vr : N Va Vr : S Va Vr : W Va Vr : E …etc(4 more cases) End Case;

Shredding Macro Cells (cont) Some macros may have fixed orientation –We tie the corner sub-cells to the corners of layout –(fake wires tying shredded pieces must be stronger) Lemma: this works for min-HPWL placers –This does not work for quadratic placers (!) Orient = N Orient = W

Initial Placement

Mixed-mode Placement Flow (2) Find a tentative placement of macros –Shred macros into fake standard-cells –Connect sub-cells with fake wires –Place “shredded netlist’’ using Capo –Compute locs of macros as average locs of sub-cells Generate a FP instance with soft & hard blocks –Cluster neighboring standard cells into soft blocks (continued later)

Physical Clustering

Mixed-mode Placement Flow (3) Find a tentative placement of macros –Shred macros into fake standard-cells –Connect sub-cells with fake wires –Place “shredded netlist’’ using Capo –Compute locs of macros as average locs of sub-cells Generate a FP instance with soft & hard blocks –Cluster neighboring standard cells into soft blocks Remove overlaps by fixed-outline floorplanning (Parquet) (continued later)

Floorplanned Design

Mixed-mode Placement Flow Find a tentative placement of macros –Shred macros into fake standard-cells –Place “shredded netlist’’ using Capo –Connect sub-cells with fake wires –Compute locs of macros as average locs of sub-cells Generate a FP instance with soft & hard blocks –Cluster neighboring standard cells into soft blocks Remove overlaps by fixed-outline FP (Parquet) Place std. cells consistently with the macros –Fix macros at current locations –Replace all standard cells using Capo

Final Placement

New Benchmarks Derived from ISPD-98 (IBM) circuits –Original specs give cell areas, but not dimensions We assumed rowheight = 16 for standard cells –Large cells  macros with AR=1 (cf. Dragon BMs) Whitespace for each design is 15 % Fixed pads placed randomly (cf. Dragon BMs) Available at : – and through

Conclusions Mixed-mode placement increasingly important Our flow combines techniques from std-cell placement & fixed-outline floorplanning Results: commercial tools can be improved Source code publicly available through: – – Ongoing work –Congestion analysis –Multilevel hierarchical floorplanning

Acknowledgements Financial support from –Gigascale Silicon Research Center –IBM Technical support from