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

Slides:



Advertisements
Similar presentations
OCV-Aware Top-Level Clock Tree Optimization
Advertisements

Fast Algorithms For Hierarchical Range Histogram Constructions
BSPlace: A BLE Swapping technique for placement Minsik Hong George Hwang Hemayamini Kurra Minjun Seo 1.
A Size Scaling Approach for Mixed-size Placement Kalliopi Tsota, Cheng-Kok Koh, Venkataramanan Balakrishnan School of Electrical and Computer 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.
Regression Analysis Once a linear relationship is defined, the independent variable can be used to forecast the dependent variable. Y ^ = bo + bX bo is.
FastPlace: Efficient Analytical Placement using Cell Shifting, Iterative Local Refinement and a Hybrid Net Model FastPlace: Efficient Analytical Placement.
CONNECTIVITY “The connectivity of a network may be defined as the degree of completeness of the links between nodes” (Robinson and Bamford, 1978).
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.
Correlation and Autocorrelation
Using Structure Indices for Efficient Approximation of Network Properties Matthew J. Rattigan, Marc Maier, and David Jensen University of Massachusetts.
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
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.
Computing Trust in Social Networks
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.
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.
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.
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.
Chemometrics Method comparison
VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 5: Global Routing © KLMH Lienig 1 FLUTE: Fast Lookup Table Based RSMT Algorithm.
Chih-Hung Lin, Kai-Cheng Wei VLSI CAD 2008
Biological Networks Lectures 6-7 : February 02, 2010 Graph Algorithms Review Global Network Properties Local Network Properties 1.
MASSOUD PEDRAM UNIVERSITY OF SOUTHERN CALIFORNIA Interconnect Length Estimation in VLSI Designs: A Retrospective.
Managing Software Projects Analysis and Evaluation of Data - Reliable, Accurate, and Valid Data - Distribution of Data - Centrality and Dispersion - Data.
Hydrologic Modeling: Verification, Validation, Calibration, and Sensitivity Analysis Fritz R. Fiedler, P.E., Ph.D.
Lecture 12 Statistical Inference (Estimation) Point and Interval estimation By Aziza Munir.
Un/DoPack: Re-Clustering of Large System-on-Chip Designs with Interconnect Variation for Low-Cost FPGAs Marvin Tom* Xilinx Inc.
Horizontal Benchmark Extension for Improved Assessment of Physical CAD Research Andrew B. Kahng, Hyein Lee and Jiajia Li UC San Diego VLSI CAD Laboratory.
CJT 765: Structural Equation Modeling Class 7: fitting a model, fit indices, comparingmodels, statistical power.
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,
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.
Lecture 20: Cluster Validation
-1- UC San Diego / VLSI CAD Laboratory Construction of Realistic Gate Sizing Benchmarks With Known Optimal Solutions Andrew B. Kahng, Seokhyeong Kang VLSI.
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.
GLARE: Global and Local Wiring Aware Routability Evaluation Yaoguang Wei1, Cliff Sze, Natarajan Viswanathan, Zhuo Li, Charles J. Alpert, Lakshmi Reddy,
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.
Whitespace Measurement and Virtual Backbone Construction for Cognitive Radio Networks: From the Social Perspective Shouling Ji and Raheem Beyah Georgia.
International Workshop on System-Level Interconnection Prediction, Sonoma County, CA March 2001ER UCLA UCLA 1 Wirelength Estimation based on Rent Exponents.
University “Ss. Cyril and Methodus” SKOPJE Cluster-based MDS Algorithm for Nodes Localization in Wireless Sensor Networks Ass. Biljana Stojkoska.
Multivariate Analysis and Data Reduction. Multivariate Analysis Multivariate analysis tries to find patterns and relationships among multiple dependent.
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.
"Fast estimation of the partitioning Rent characteristic" Fast estimation of the partitioning Rent characteristic using a recursive partitioning model.
On Exploiting Transient Social Contact Patterns for Data Forwarding in Delay-Tolerant Networks 1 Wei Gao Guohong Cao Tom La Porta Jiawei Han Presented.
Assumptions of Multiple Regression 1. Form of Relationship: –linear vs nonlinear –Main effects vs interaction effects 2. All relevant variables present.
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
Congestion-Driven Re-Clustering for Low-cost FPGAs MASc Examination Darius Chiu Supervisor: Dr. Guy Lemieux University of British Columbia Department of.
Global predictors of regression fidelity A single number to characterize the overall quality of the surrogate. Equivalence measures –Coefficient of multiple.
Placement and Routing Algorithms. 2 FPGA Placement & Routing.
Global predictors of regression fidelity A single number to characterize the overall quality of the surrogate. Equivalence measures –Coefficient of multiple.
Prediction of Interconnect Net-Degree Distribution Based on Rent’s Rule Tao Wan and Malgorzata Chrzanowska- Jeske Department of Electrical and Computer.
Regression Analysis AGEC 784.
Revisiting and Bounding the Benefit From 3D Integration
APLACE: A General and Extensible Large-Scale Placer
Introduction Secondary Users (SUs) Primary Users (PUs)
Predict Failures with Developer Networks and Social Network Analysis
A Semi-Persistent Clustering Technique for VLSI Circuit Placement
NonLinear Dimensionality Reduction or Unfolding Manifolds
Presentation transcript:

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

Previous work and motivation Intrinsic Shortest Path Length (ISPL) definition Validation of ISPL as wirelength estimator Practical Applications: A Priori Total wirelength estimation A Priori Global interconnect prediction Relationship to Rent parameter Outline

Definition and Applications A priori wirelength estimation is the process of estimating and predicting the wirelength characteristics of VLSI netlists without knowledge of the netlist placement or floorplanning. Applications that benefit from a priori wirelength estimation: Physical driven synthesis  Faster timing convergence Early system planning Determining amount of necessary whitespace VLSI netlist characterization/reverse engineering/creation

Previous Work Previous approaches: Correlators: If some measure e correlates with net length l then e can be used in relevant applications, e.g., clustering. Typically no analytical modeling between l and e. Examples: mutual contraction and edge separability. Average wirelength estimators: Rent parameter-based. Predict aggregate wirelength characteristics, e.g., wirelength distribution and total wirelength.

Motivation Wanted: Estimator has intuitive physical meaning Handles hypergraphs transparently Individual net length estimator: If l 1 > l 2 then e 1 > e 2 Analytical modeling between l i and e i, e.g., l i = f(e i ) Estimator and wirelength have similar distributions Total wirelength estimation Practical runtime for calculation

A Motivating Observation a b Nodes a and b are directly connected by an edge. Does this mean a and b will be placed spatially close in a good placement? Input Netlist Observation: Unlikely. Despite edge {a, b}, a and b are “structurally” far from each other

Intrinsic Shortest Path Length (ISPL) a b Input Netlist “structural proximity”  shortest path shortest path between nodes a and b that does not include {a, b}. Will edge {a, b} be short? analyze the “structural proximity” of a and b Example: ISPL of {a, b} = 8. {a, b} and its ISP form a cycle BUT: Netlists are hypergraphs  a transparent mechanism is needed To estimate the Intrinsic Shortest Path Length ISPL of edge {a, b} : delete {a, b} and calculate the shortest path length (number of edges) between a and b

ISPL in Hypergraphs Set the “distance” or weight of a k-pin hyperedge by k/2 u v ISPL of {u, v} = = 3.5 ab c h The ISPL of a k-pin hyperedge, h = {a, b, c}, is calculated as follows: 1. Delete h 2. Calculate the ISPL for every pair of nodes that belong to h: {a, b}, {b, c}, and {a, c} 3. The ISPL of h is maximum among all values calculated in Step 2 Runtime requirement: n: number of nodes, m number of edges

Previous work and motivation Intrinsic Shortest Path Length (ISPL) definition Validation of ISPL as wirelength estimator Practical Applications: A Priori Total wirelength estimation A Priori Global interconnect prediction Relationship to Rent parameter Outline

Validation of ISPL as Wirelength Estimator To validate our observation: 1.Correlation between the placed net length and net ISPL? 2.Correlation between the effect of net pin count on average net length and average net ISPL? 3. Correlation between the average/total netlist wirelength and the average/total ISPL over a range of benchmarks? 4. Given two individual nets of some netlist, can we predict which individual net will be placed with greater wirelength? 5. Relationship between the distribution, or profile, of ISPL and the wirelength distribution?

Validation: 1. ISPL and Net Length Objective: validation of the relationship between ISPL and net length: Given a netlist (ibm01): 1. Calculate the ISPL of every hyperedge 2. Place the netlist using some placer (Dragon) 3. Plot ISPL versus Half-Perimeter Wirelength (HPWL) of every net 100 buckets 30 buckets As ISPL increases, HPWL increases Correlation coefficient 0.91 Reduce data clutter by dividing data into buckets and averaging the results within each bucket

Validation: 1. ISPL and Net Length CircuitISPLMCES ibm ibm ibm ibm ibm ibm ibm ibm ibm Average |correlation coefficients| MC is mutual connectivity ES is edge separability Calculate correlation coefficients between ISPL and wirelength For comparison, calculate correlation coefficient between: Mutual Contraction (UCSB) and HPWL Edge Separability (UCLA) and HPWL

Validation: 2. Effect of Pin Count Average length of k-pin nets Average ISPL of k-pin nets Objective: Test the effect of pin count on both average wirelength and ISPL For every k (2…) on ibm01: Calculate the average ISPL of all k-pin net Run a placer and calculate the average placed wirelength of all k-pin nets Correlation coefficient of 0.95 between average HPWL and average ISPL (typical result)

Validation: 3. Average ISPL and Total Wirelength Objective: Is the average ISPL correlated with the total wirelength? CircuitRent parameter WirelengthAv. ISPL GNL GNL GNL GNL GNL Synthesize netlists (10k nodes/nets) with varying Rent parameter with GNL A higher rent parameter  more global communication  larger wirelength Calculate the average ISPL of each netlist Place the netlists using mPL and measure the HPWL Perfect correlation between average ISPL and total wirelength

Validation: 4. Individual Net Length Prediction Objective: Given two arbitrary nets i and j with the same number of pins, can we a priori decide which net will be longer? Predictor Oracle i j Success? { , <} Yes/No Dragon gives the best placement and will be used as an Oracle Performance of the Predictor: Lower bound is 50% Upper bound is the performance of any other placer What is performance if we use ISPL for the predictor?

Validation: 4. Individual Net Length Prediction benchCapo9mPL4FS2.6MCISPL ibm ibm ibm ibm ibm ibm ibm ibm ibm Average MC: Mutual Contraction ISPL: Intrinsic Shortest Path Length The success of prediction in percentage

Validation: 5. ISPL and Net Length Distribution Sort all nets according to their ISPL and their HPWL Plot all sorted HPWL normalized to the maximum HPWL value Plot all sorted ISPL normalized to the maximum ISPL value ISPL and HPWL have roughly similar profiles HPWLISPL Objective: Examine the relationship between ISPL and HPWL profiles

Previous work and motivation Intrinsic Shortest Path Length (ISPL) definition Validation of ISPL as wirelength estimator Practical Applications: A Priori Total wirelength estimation A Priori Global interconnect prediction Relationship to Rent parameter Outline

Applications: 1. A Priori Wirelength Total Estimation Devise an analytical model between ISPL and HPWL Using empirical data, we find an exponential relationship between ISPL and wirelength symbolMeaning kNumber of pins on a net sISPL akak constant of netlist and k gkgk HPWL of k-pin net with ISPL=s Exponential fitting Actual results

Applications: 1. A Priori Total Wirelength Estimation kakak gkgk ……… 20…… How to determine a k and g k ? Ideal modeling (not a priori): based on the netlist characteristics from the placement (only useful for model validation and calibration) Static modeling (a priori): fixed values for all netlists based on values typically encountered

Applications: 1. A Priori Total Wirelength Estimation An estimate function that minimizes the total square error Objective: Given m ideal models, how to calculate an approximate static model ? m ideal exponential fits (from typical netlists) linearize calculate exp model

Applications: 1. A Priori Total Wirelength Estimation circuitstaticidealcircuitstaticideal ibm %-3.52%ibm %0.64% ibm107.36%9.39%ibm %3.14% ibm %-1.45%ibm %0.44% ibm %-1.56%ibm %-0.34% ibm %0.22%ibm %-1.11% Calculate the total wirelength of the IBM (version 1) benchmarks (unit size cells) using ideal model Calculate typical values and use it for a priori static modeling. On the average, ideal modeling is 3.61% accurate compared to actual HPWL. Static modeling is 16.60% accurate

Applications: 2. A Priori Global Interconnect Prediction Global interconnects hurt performance and are typically buffered Objective: Can we a priori decide which nets are going to be “long” before placement? Definition: a net is global (long) if it is in the top 5% of the longest nets in the final placement Given a netlist: 1. Calculate the ISPL of all nets 2. Sort all nets based on their ISPL 3. Plot net count vs ISPL If we declare all nets with ISPL  15 then we declare 10% of all nets global, actually capturing the 60% of the future global interconnects All nets Global nets

Previous work and motivation Intrinsic Shortest Path Length (ISPL) definition Validation of ISPL as wirelength estimator Practical Applications: A Priori Total wirelength estimation A Priori Global interconnect prediction Relationship to Rent parameter Outline

Relationship to Rent Parameter  We develop a characterization, Range Parameter, of VLSI netlists Definition 1: The range of a node u is the average ISPL of all nets incident to it. Definition 2: The Range of a netlist is the average range of all nodes V.  The larger a node’s range, the more wirelength it needs to communicate with its neighbor  A large Range parameter predicts that a netlist would require a large amount of global communication.

Relationship to Rent Parameter Intuitive connection to Rent parameter: a netlist with large Rent parameter  requires more global communication in any good placement RangeRent Correlation coefficient of 0.701

Rent Parameter Range Parameter Calculated in top-down fashion Calculated in bottom-up fashion Useful for complete netlist characterization Useless for individual net prediction Useful for individual net prediction Unstable value Stable value (same topology) benchRentRangebenchRentRange ibm ibm ibm ibm ibm ibm ibm ibm ibm ibm  Runtime normalized with respect to FengShui Hypergraph to graph transformation works on graphs or hypergraphs

Conclusions Developed the new concept of Intrinsic Shortest Path Length (ISPL) Demonstrated strong correlation between ISPL and HPWL Used it for individual net length predictor Correlated average ISPL with total wirelength Studied the relationship between ISPL and HPWL distributions Developed a characterization to VLSI netlists and studied its relation to Rent parameter Used ISPL for two practical applications: Total wirelength estimation Global interconnect prediction

Future Work Runtime improvement Studying the effect of different net weights on ISPL performance Better wirelength models Synthetic benchmark generation based on ISPL Analytical relationship between Range and Rent parameters Fixed blocks/white space effects Deducing wirelength distribution, pin-effect count from the analytical models Estimating RSMT by using weighting coefficients

Thank you