Recursive Bisection Placement*: feng shui 5.0 Ameya R. Agnihotri Satoshi Ono Patrick H. Madden SUNY Binghamton CSD, FAIS, University of Kitakyushu (with.

Slides:

Advertisements

Similar presentations

MIP-based Detailed Placer for Mixed-size Circuits Shuai Li, Cheng-Kok Koh ECE, Purdue University {li263,

Advertisements

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.

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

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.

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.

1 Physical Hierarchy Generation with Routing Congestion Control Chin-Chih Chang *, Jason Cong *, Zhigang (David) Pan +, and Xin Yuan * * UCLA Computer.

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.

High-Level Constructors and Estimators Majid Sarrafzadeh and Jason Cong Computer Science Department

Early Days of Circuit Placement Martin D. F. Wong Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.

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.

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.

International Symposium of Physical Design Sonoma County, CA April 2001ER UCLA UCLA 1 Congestion Estimation During Top-Down Placement Xiaojian Yang Ryan.

Benchmarking for Large-Scale Placement and Beyond S. N. Adya, M. C. Yildiz, I. L. Markov, P. G. Villarrubia, P. N. Parakh, P. H. Madden.

An Analytic Placer for Mixed-Size Placement and Timing-Driven Placement Andrew B. Kahng and Qinke Wang UCSD CSE Department {abk, Work.

Andrew Kahng – November 2002 ICCAD-2002 Open Source Panel Andrew B. Kahng UC San Diego CSE & ECE Depts. Igor L. Markov Univ. of Michigan EECS Dept.

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

Andrew Kahng – October Layout Planning of Mixed- Signal Integrated Circuits Chung-Kuan Cheng / Andrew B. Kahng UC San Diego CSE Department.

ICS 252 Introduction to Computer Design Lecture 15 Winter 2004 Eli Bozorgzadeh Computer Science Department-UCI.

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.

EDA (CS286.5b) Day 7 Placement (Simulated Annealing) Assignment #1 due Friday.

DUSD(Labs) GSRC bX update March 2003 Aaron Ng, Marius Eriksen and Igor Markov University of Michigan.

POLAR 2.0: An Effective Routability-Driven Placer Chris Chu Tao Lin.

Fall 2003EE VLSI Design Automation I 149 EE 5301 – VLSI Design Automation I Kia Bazargan University of Minnesota Part V: Placement.

Placement-Centered Research Directions and New Problems Xiaojian Yang Amir Farrahi Synplicity Inc.

VLSI Physical Design Automation

Mixed-Size Placement with Fixed Macrocells using Grid-Warping Zhong Xiu*, Rob Rutenbar * Advanced Micro Devices Inc., Department of Electrical and Computer.

CRISP: Congestion Reduction by Iterated Spreading during Placement Jarrod A. Roy†‡, Natarajan Viswanathan‡, Gi-Joon Nam‡, Charles J. Alpert‡ and Igor L.

Horizontal Benchmark Extension for Improved Assessment of Physical CAD Research Andrew B. Kahng, Hyein Lee and Jiajia Li UC San Diego VLSI CAD Laboratory.

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.

1 Wire Length Prediction-based Technology Mapping and Fanout Optimization Qinghua Liu Malgorzata Marek-Sadowska VLSI Design Automation Lab UC-Santa Barbara.

Improved Cut Sequences for Partitioning Based Placement Mehmet Can YILDIZ and Patrick H. Madden State University of New York at BinghamtonComputer Science.

CSE 494: Electronic Design Automation Lecture 2 VLSI Design, Physical Design Automation, Design Styles.

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

Jason Cong‡†, Guojie Luo*†, Kalliopi Tsota‡, and Bingjun Xiao‡ ‡Computer Science Department, University of California, Los Angeles, USA *School of Electrical.

Session 10: The ISPD2005 Placement Contest. 2 Outline  Benchmark & Contest Introduction  Individual placement presentation  FastPlace, Capo, mPL, FengShui,

Congestion Estimation and Localization in FPGAs: A Visual Tool for Interconnect Prediction David Yeager Darius Chiu Guy Lemieux The University of British.

Reporting of Standard Cell Placement Results Patrick H. Madden SUNY Binghamton CSD BLAC CAD Group

International Workshop on System-Level Interconnection Prediction, Sonoma County, CA March 2001ER UCLA UCLA 1 Wirelength Estimation based on Rent Exponents.

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.

RULES TO AVOID BAD DESIGN 1. Don’t annoy your viewers. Don't use frames unless you have to! - Frames are annoying and cause people to lose their way when.

Unified Quadratic Programming Approach for Mixed Mode Placement Bo Yao, Hongyu Chen, Chung-Kuan Cheng, Nan-Chi Chou*, Lung-Tien Liu*, Peter Suaris* CSE.

Constraint-Driven Large Scale Circuit Placement Algorithms Advisor: Prof. Jason Cong Student: Min Xie September, 2006.

International Symposium on Physical Design San Diego, CA April 2002ER UCLA UCLA 1 Routability Driven White Space Allocation for Fixed-Die Standard-Cell.

Design Automation Conference (DAC), June 6 th, Taming the Complexity of Coordinated Place and Route Jin Hu †, Myung-Chul Kim †† and Igor L. Markov.

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.

The Early Days of Automatic Floorplan Design

CAD-IP Reuse via the Bookshelf for Fundamental VLSI CAD Algorithms

HeAP: Heterogeneous Analytical Placement for FPGAs

Andrew B. Kahng and Xu Xu UCSD CSE and ECE Depts.

APLACE: A General and Extensible Large-Scale Placer

Verilog to Routing CAD Tool Optimization

mPL 5 Overview ISPD 2005 Placement Contest Entry

ICCAD-2002 Open Source Panel Andrew B

Presentation transcript:

Recursive Bisection Placement*: feng shui 5.0 Ameya R. Agnihotri Satoshi Ono Patrick H. Madden SUNY Binghamton CSD, FAIS, University of Kitakyushu (with code by Mehmet Can Yildiz and Ateen Khatkhate, and with help from Purdue’s Cheng-Kok Koh and Chen Li) This work was supported by an IBM Faculty Partnership Award, SRC Project 947.1, an equipment grant from Intel, NYSTAR MDC, and by funds from the Japanese Ministry of ECSST via Kitakyushu and Fukuoka knowledge-based cluster project. * We abandoned recursive bisection about 6 months ago…

Where is Kitakyushu?

feng shui versions 1.0: basic bisection engine [ISPD99,GLSVLSI01] iterative deletion, cycling, terminal propagation work. 1.5: cut sequence optimization [DAC01] paper with Rent’s rule. 2.0: Fractional cut [ICCAD03] results close to annealing; possible to place very very dense. 2.4, 2.6: Mixed size placement paper [ISPD04] results improved by 26% on average over the closest competing tool. 3.0: Structural (beacon) placer [ASPDAC05] new method designed to have fun with the PEKO benchmarks; currently within 22% of optimal. 5.0: Integration of tools GUI front end, [GLSVSLI00] non-Manhattan global router, [DAC03] global router, [ISCAS05] delay analysis, PowerARC delay library, support for LEF/DEF, gate sizing tool… Versions of the stand-alone placer are available in both hMetis and MLPart flavors. 5% or so improvements on mixed size placement (with minor tuning). The bisection based placement engine is now in maintainence mode; we’ll fix minor problems, but it’s not our main focus.

Bisection Based Placement Logic elementsSemiconductor chip

Fractional Cut Bisection

Mixed Size Fractional Cut Min cut (hMetis) Area X Area Y Area X

IBM01 before legalization

Placement Legalization Standard cells: Dynamic programming approaches [ICCAD03], and an unpublished method. Moving macro blocks: [ISPD04] Extension of the tetris method by Hill. Fixed macro blocks: Fractured row legalization [Khatkhate MS thesis].

ISPD04 Experimental Results Capo 1 ISPD02 Capo 2 ICCAD03 Capo 3 ICCAD03 mPG-ms ASPDAC03 Feng Shui 2.4 ISPD04 Ibm Ibm Ibm Ibm Ibm Ibm Ibm … Average As much as 51% better on some benchmarks. Closest is around 8%, for the design that doesn’t have macro blocks.

Now about the contest… The designs have very large amounts of internal white space (apples vs. oranges) Space MUST be distributed internally to have any chance of a good result (due to fixed locations of the macro blocks) We have no support at all for internal white space distribution Or, to be more precise… The correct location for white space is usually outside of the core.

Example IBM Our contest result The right answer

Example

How Much White Space Do You Really Need? If you had 100X more space, would you really want to stretch that far? Why do the industry guys do this? Put space in early for sizing and routability Or even better, use something like…. [ICCAD04] cut line shifting for routability. [ASPDAC05], same idea for gate sizing and buffer insertion. We’ve integrated our global router and sizing tools with the placer to avoid needing to insert excess space.

Placement Contest, Round 2 We’re going to lose round 1; that’s for sure. Apples vs. oranges problem; some of the apple placement methods are going to look very bad… Who’s up for another round? Moving macro blocks? Rotation of blocks? Mirroring cells? Or round 1 again, but give me some time to finish the move away from recursive bisection! Routing benchmark announcement Patrick Groeneveld, Jurjen Westra, and myself, have been working on global routing benchmarking. We’ll talk about this at EDP. WANTED: more research groups in routing!

Better Visualization (feng shui 5.0 GUI version) Start with a “reference placement” For the PEKOs, this is the known optimal Map pixel colors from an image onto cells in the reference placement Rearrange the cells to match a placement under study Keep the cell colors from the reference

Fun with the PEKOs If the placement is optimal, the mapped image should be identical to the reference image. Source Image (Prof. Jason Cong) Optimal placement for PEKO01 in the feng shui 5.0 GUI Image mapped onto the cells And then rearranged to match the placement of mPL

feng shui 5.0 Suboptimality Rogues Gallery mPLDragonCapo Prof. Jason Cong Prof. Majid Sarrafzadeh Prof. Igor Markov Prof. Patrick H. Madden feng shui Satoshi Ono Beacon 26% HPWL improvement on mixed size, fractional cut, non-Manhattan, and what do people ask about? The funny pictures from the GUI…