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

Slides:

Advertisements

Similar presentations

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.

Advertisements

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

Hoofdstuk 6 Het voorspellen van prestaties Prof. dr. ir. Dirk Stroobandt Academiejaar

Interconnect Complexity-Aware FPGA Placement Using Rent’s Rule G. Parthasarathy Malgorzata Marek-Sadowska Arindam Mukherjee Amit Singh University of California,

X-Architecture Placement Based on Effective Wire Models Tung-Chieh Chen, Yi-Lin Chuang, and Yao-Wen Chang Graduate Institute of Electronics Engineering.

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.

Intrinsic Shortest Path Length: A New, Accurate A Priori Wirelength Estimator Andrew B. KahngSherief Reda VLSI CAD Laboratory.

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.

ER UCLA UCLA ICCAD: November 5, 2000 Predictable Routing Ryan Kastner, Elaheh Borzorgzadeh, and Majid Sarrafzadeh ER Group Dept. of Computer Science UCLA.

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

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

EDA (CS286.5b) Day 5 Partitioning: Intro + KLFM. Today Partitioning –why important –practical attack –variations and issues.

On Modeling and Sensitivity of Via Count in SOC Physical Implementation Kwangok Jeong Andrew B. Kahng.

Placement Feedback: A Concept and Method for Better Min-Cut Placements Andrew B. KahngSherief Reda CSE & ECE Departments University of CA, San Diego La.

Dirk Stroobandt Ghent University Electronics and Information Systems Department A Priori System-Level Interconnect Prediction The Road to Future Computer.

On Legalization of Row-Based Placements Andrew B. KahngSherief Reda CSE & ECE Departments University of CA, San Diego La Jolla, CA 92093

Dirk Stroobandt Ghent University Electronics and Information Systems Department A Priori System-Level Interconnect Prediction The Road to Future Computer.

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

Can Recursive Bisection Alone Produce Routable Placements? Andrew E. Caldwell Andrew B. Kahng Igor L. Markov Supported by Cadence.

Studies of Timing Structural Properties for Early Evaluation of Circuit Design Andrew B. Kahng*, Ryan Kastner, Stefanus Mantik, Majid Sarrafzadeh and Xiaojian.

Lecture 9: Multi-FPGA System Software October 3, 2013 ECE 636 Reconfigurable Computing Lecture 9 Multi-FPGA System Software.

ISPD 2000, San DiegoApr 10, Requirements for Models of Achievable Routing Andrew B. Kahng, UCLA Stefanus Mantik, UCLA Dirk Stroobandt, Ghent.

Ryan Kastner ASIC/SOC, September Coupling Aware Routing Ryan Kastner, Elaheh Bozorgzadeh and Majid Sarrafzadeh Department of Electrical and Computer.

Interconnect Implications of Growth-Based Structural Models for VLSI Circuits* Chung-Kuan Cheng, Andrew B. Kahng and Bao Liu UC San Diego CSE Dept.

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

Balancing Interconnect and Computation in a Reconfigurable Array Dr. André DeHon BRASS Project University of California at Berkeley Why you don’t really.

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

International Symposium of Physical Design San Diego, CA April 2002ER UCLA UCLA 1 Experimental Setup Cadence QPlace Cadence WRoute LEF/DEFLEF/DEF Dragon.

הטכניון - מ.ט.ל. הפקולטה להנדסת חשמל - אביב תשס"ה

Confidentiality Preserving Integer Programming for Global Routing Hamid Shojaei, Azadeh Davoodi, Parmesh Ramanathan Department of Electrical and Computer.

Are Floorplan Representations Important in Digital Design? H. H. Chan, S. N. Adya, I. L. Markov The University of Michigan.

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,

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.

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

Massachusetts Institute of Technology 1 L14 – Physical Design Spring 2007 Ajay Joshi.

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,

Georgia Institute of Technology, Microelectronics Research Center Prediction of Interconnect Fan-out Distribution Using Rent’s Rule Payman Zarkesh-Ha,

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.

1 ER UCLA ISPD: Sonoma County, CA, April, 2001 An Exact Algorithm for Coupling-Free Routing Ryan Kastner, Elaheh Bozorgzadeh,Majid Sarrafzadeh.

Optimality, Scalability and Stability study of Partitioning and Placement Algorithms Jason Cong, Michail Romesis, Min Xie UCLA Computer Science Department.

Routability-driven Floorplanning With Buffer Planning Chiu Wing Sham Evangeline F. Y. Young Department of Computer Science & Engineering The Chinese University.

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.

ISPD 2001, Sonoma County, April 3rd, Consistent Floorplanning with Super Hierarchical Constraints Yukiko KUBO, Shigetoshi NAKATAKE, and Yoji KAJITANI.

"Fast estimation of the partitioning Rent characteristic" Fast estimation of the partitioning Rent characteristic using a recursive partitioning model.

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

Dirk Stroobandt Ghent University Electronics and Information Systems Department A Priori System-Level Interconnect Prediction Rent’s Rule and Wire Length.

Pre-layout prediction of interconnect manufacturability Phillip Christie University of Delaware USA Jose Pineda de Gyvez Philips Research Laboratories.

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

Dirk Stroobandt Ghent University Electronics and Information Systems Department A New Design Methodology Based on System-Level Interconnect Prediction.

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

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.

Dirk Stroobandt Ghent University Electronics and Information Systems Department Multi-terminal Nets do Change Conventional Wire Length Distribution Models.

Prediction of Interconnect Net-Degree Distribution Based on Rent’s Rule Tao Wan and Malgorzata Chrzanowska- Jeske Department of Electrical and Computer.

Mincut Placement (1/12)Practical Problems in VLSI Physical Design Mincut Placement Perform quadrature mincut onto 4 × 4 grid  Start with vertical cut.

Revisiting and Bounding the Benefit From 3D Integration

Defect Tolerance for Nanocomputer Architecture

Interconnect Architecture

Presentation transcript:

International Workshop on System-Level Interconnection Prediction, Sonoma County, CA March 2001ER UCLA UCLA 1 Wirelength Estimation based on Rent Exponents of Partitioning and Placement Xiaojian Yang Elaheh Bozorgzadeh Majid Sarrafzadeh Embedded and Reconfigurable System Lab Computer Science Department, UCLA Xiaojian Yang Elaheh Bozorgzadeh Majid Sarrafzadeh Embedded and Reconfigurable System Lab Computer Science Department, UCLA

International Workshop on System-Level Interconnection Prediction, Sonoma County, CA March 2001ER UCLA UCLA 2OutlineOutline Introduction Motivation Rent Exponents of Partitioning and Placement Wirelength Estimation based on Rent’s rule Rent Exponent and Placement Quality Conclusion Introduction Motivation Rent Exponents of Partitioning and Placement Wirelength Estimation based on Rent’s rule Rent Exponent and Placement Quality Conclusion

International Workshop on System-Level Interconnection Prediction, Sonoma County, CA March 2001ER UCLA UCLA 3IntroductionIntroduction Rent’s rule and its application P = TB r Introduced by Landman and Russo, 1971 Used for Wirelength estimation Rent Exponent Key role in Rent’s rule applications Extracted from partitioning-based method “Intrinsic Rent exponent”, Hagen, et.al 1994 Rent’s rule and its application P = TB r Introduced by Landman and Russo, 1971 Used for Wirelength estimation Rent Exponent Key role in Rent’s rule applications Extracted from partitioning-based method “Intrinsic Rent exponent”, Hagen, et.al 1994

International Workshop on System-Level Interconnection Prediction, Sonoma County, CA March 2001ER UCLA UCLA 4 Introduction (cont’d) Two Rent Exponents Topological and Geometrical (Christie, SLIP2000) Partitioning and Placement Questions: Same or different? Which one is appropriate for Rent’s rule applications? Relationship? Two Rent Exponents Topological and Geometrical (Christie, SLIP2000) Partitioning and Placement Questions: Same or different? Which one is appropriate for Rent’s rule applications? Relationship?

International Workshop on System-Level Interconnection Prediction, Sonoma County, CA March 2001ER UCLA UCLA 5 Partitioning Rent Exponent log P log B B – Number of cells P – Number of external nets

International Workshop on System-Level Interconnection Prediction, Sonoma County, CA March 2001ER UCLA UCLA 6 Partitioning Rent Exponent slope = r log P log B B – Number of cells P – Number of external nets

International Workshop on System-Level Interconnection Prediction, Sonoma County, CA March 2001ER UCLA UCLA 7 Placement Rent exponent log P log B slope = r’

International Workshop on System-Level Interconnection Prediction, Sonoma County, CA March 2001ER UCLA UCLA 8 Difference between two exponents Partitioning objective: Minimizing cut-size Embed partitions into two-dimensional plane Cut-size increases in placement compared to partitioning Partitioning objective: Minimizing cut-size Embed partitions into two-dimensional plane Cut-size increases in placement compared to partitioning log P log B Placement Partitioning Placement r’ > Partitioning r

International Workshop on System-Level Interconnection Prediction, Sonoma County, CA March 2001ER UCLA UCLA 9 Relation between two Rent exponents Based on min-cut placement approaches (recursively bipartitioning) Different partitioning instances Partitioning tree approach: Pure Partitioning Partitioning in Placement: terminal propagation Based on min-cut placement approaches (recursively bipartitioning) Different partitioning instances Partitioning tree approach: Pure Partitioning Partitioning in Placement: terminal propagation

International Workshop on System-Level Interconnection Prediction, Sonoma County, CA March 2001ER UCLA UCLA 10 Pure Partitioning Cut-size = C Cut-size = C

International Workshop on System-Level Interconnection Prediction, Sonoma County, CA March 2001ER UCLA UCLA 11 Terminal Propagation Cut-size = C’ > C Cut-size = C’ > C

International Workshop on System-Level Interconnection Prediction, Sonoma County, CA March 2001ER UCLA UCLA 12 Cut size increases cut-size : C  C’ cut-size : C  C’ P P P1 P1 P1 P1 P1 P1 P1 P1 P2 P2 P2 P2 P2 P2 P2 P2 CC B2 B2 B2 B2 B2 B2 B2 B2 B1 B1 B1 B1 B1 B1 B1 B1 u u P 1 +C = TB 1 r = P P 1 +C = TB 1 r = P P 1 +P 2 = T(B 1 +B 2 ) r P 1 +P 2 = T(B 1 +B 2 ) r P 1 = 2 r-1 P P 1 = 2 r-1 P  --- effect of external net

International Workshop on System-Level Interconnection Prediction, Sonoma County, CA March 2001ER UCLA UCLA 13RelationshipRelationship r --- Partitioning Rent exponent r’ --- Placement Rent exponent B --- number of cells     1, effect of external net r --- Partitioning Rent exponent r’ --- Placement Rent exponent B --- number of cells     1, effect of external net Limited Range Limited Range Rough Estimation from r to r’ Rough Estimation from r to r’ Limited Range Limited Range Rough Estimation from r to r’ Rough Estimation from r to r’

International Workshop on System-Level Interconnection Prediction, Sonoma County, CA March 2001ER UCLA UCLA 14 Experiment Background Benchmark: MCNC+IBM IBM: Derived from ISPD98 partitioning benchmark Size from 20k cells k cells Partitioning: hMetis Placement: wirelength-driven Capo, Feng Shui, Dragon Rent exponent extraction Linear regression Each point corresponds to one level in partitioning or placement Benchmark: MCNC+IBM IBM: Derived from ISPD98 partitioning benchmark Size from 20k cells k cells Partitioning: hMetis Placement: wirelength-driven Capo, Feng Shui, Dragon Rent exponent extraction Linear regression Each point corresponds to one level in partitioning or placement

International Workshop on System-Level Interconnection Prediction, Sonoma County, CA March 2001ER UCLA UCLA 15 Experimental Observation (1) Example: ibm11, 68k cells Partitioning r Placement r’ Estimated Placement r’ CapoCapo Feng Shui DragonDragon

International Workshop on System-Level Interconnection Prediction, Sonoma County, CA March 2001ER UCLA UCLA 16 Wirelength Estimation based on Rent’s rule Classical problem Donath 1979 Stroobandt et.al 1994 Davis et.al 1998 Needs geometrical (placement) Rent exponent Comparison Estimated WL using Partitioning Rent exponent Estimated WL using Placement Rent exponent Total Wirelength after global routing (maze-based) Classical problem Donath 1979 Stroobandt et.al 1994 Davis et.al 1998 Needs geometrical (placement) Rent exponent Comparison Estimated WL using Partitioning Rent exponent Estimated WL using Placement Rent exponent Total Wirelength after global routing (maze-based)

International Workshop on System-Level Interconnection Prediction, Sonoma County, CA March 2001ER UCLA UCLA 17 Experimental Observation (2) Example: ibm13, 81k cells Overall: Estimation based on Partitioning Rent exponent under-estimate total wirelength 19% % Example: ibm13, 81k cells Overall: Estimation based on Partitioning Rent exponent under-estimate total wirelength 19% % Partitioning r = Partitioning Actual WL Capo FS Dragon Actual WL Capo FS Dragon Placement Rent r’ Capo FS Dragon Placement Rent r’ Capo FS Dragon

International Workshop on System-Level Interconnection Prediction, Sonoma County, CA March 2001ER UCLA UCLA 18 Estimation based on r’ Recursively bipartitioning Derivation of Placement Rent exponent circuitcircuit Wirelength Estimation Estimated total wirelength Estimated r (partition r)r r’ r’ (place r)

International Workshop on System-Level Interconnection Prediction, Sonoma County, CA March 2001ER UCLA UCLA 19 Estimation based on r’ Estimation results: -12% % Total wirelength estimation is hard Rent exponent Placement approach Routing approach Congestion --- unevenly distributed wires Estimation results: -12% % Total wirelength estimation is hard Rent exponent Placement approach Routing approach Congestion --- unevenly distributed wires

International Workshop on System-Level Interconnection Prediction, Sonoma County, CA March 2001ER UCLA UCLA 20 Rent exponent, a placement metric? Hagen et.al Rent exponent is a measurement of partitioning approach Ratio-cut gives the smallest Rent exponent Similar case in Placement? Ordinary placement measurement Total bounding box wirelength or routed wirelength Correlation between wirelength and Rent exponent? Hagen et.al Rent exponent is a measurement of partitioning approach Ratio-cut gives the smallest Rent exponent Similar case in Placement? Ordinary placement measurement Total bounding box wirelength or routed wirelength Correlation between wirelength and Rent exponent?

International Workshop on System-Level Interconnection Prediction, Sonoma County, CA March 2001ER UCLA UCLA 21 Experimental Observation Rent exponent Bounding box wirelength wirelength RoutedwirelengthRoutedwirelength Weak correlation: most shorter wirelengths Weak correlation: most shorter wirelengths correspond to lower Rent exponents correspond to lower Rent exponents Open question Open question Weak correlation: most shorter wirelengths Weak correlation: most shorter wirelengths correspond to lower Rent exponents correspond to lower Rent exponents Open question Open question

International Workshop on System-Level Interconnection Prediction, Sonoma County, CA March 2001ER UCLA UCLA 22ConclusionConclusion Topological (partitioning) Rent exponent and Geometrical (placement) Rent exponent are different. Relationship between two Rent exponents. Wirelength Estimation should use Geometrical Rent exponent. Open question: Is Rent exponent a metric of placement quality? Topological (partitioning) Rent exponent and Geometrical (placement) Rent exponent are different. Relationship between two Rent exponents. Wirelength Estimation should use Geometrical Rent exponent. Open question: Is Rent exponent a metric of placement quality?