© Yamacraw, 2001 Minimum-Buffered Routing of Non-Critical Nets for Slew Rate and Reliability A. Zelikovsky GSU Joint work with C. Alpert.

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

ECE 667 Synthesis and Verification of Digital Circuits
OCV-Aware Top-Level Clock Tree Optimization
Advanced Interconnect Optimizations. Buffers Improve Slack RAT = 300 Delay = 350 Slack = -50 RAT = 700 Delay = 600 Slack = 100 RAT = 300 Delay = 250 Slack.
Multicast in Wireless Mesh Network Xuan (William) Zhang Xun Shi.
4/22/ Clock Network Synthesis Prof. Shiyan Hu Office: EREC 731.
Buffer and FF Insertion Slides from Charles J. Alpert IBM Corp.
ELEN 468 Lecture 261 ELEN 468 Advanced Logic Design Lecture 26 Interconnect Timing Optimization.
Confidentiality/date line: 13pt Arial Regular, white Maximum length: 1 line Information separated by vertical strokes, with two spaces on either side Disclaimer.
1 Interconnect Layout Optimization by Simultaneous Steiner Tree Construction and Buffer Insertion Presented By Cesare Ferri Takumi Okamoto, Jason Kong.
F.F. Dragan (Kent State) A.B. Kahng (UCSD) I. Mandoiu (UCLA) S. Muddu (Sanera Systems) A. Zelikovsky (Georgia State) Provably Good Global Buffering by.
Ion Mandoiu (Georgia Tech) Alex Zelikovsky (Georgia State) ISMP 2000 Practical Approximation Algorithms for Zero- and Bounded-Skew Trees.
Constructing Minimal Spanning Steiner Trees with Bounded Path Length Presenter : Cheng-Yin Wu, NTUGIEE Some of the Slides in this Presentation are Referenced.
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.
A.B. Kahng, Ion I. Mandoiu University of California at San Diego, USA A.Z. Zelikovsky Georgia State University, USA Supported in part by MARCO GSRC and.
Introduction to Approximation Algorithms Lecture 12: Mar 1.
Minimum-Buffered Routing of Non- Critical Nets for Slew Rate and Reliability Control Supported by Cadence Design Systems, Inc. and the MARCO Gigascale.
Circuit Retiming with Interconnect Delay CUHK CSE CAD Group Meeting One Evangeline Young Aug 19, 2003.
38 th Design Automation Conference, Las Vegas, June 19, 2001 Creating and Exploiting Flexibility in Steiner Trees Elaheh Bozorgzadeh, Ryan Kastner, Majid.
F.F. Dragan (Kent State) A.B. Kahng (UCSD) I. Mandoiu (UCLA/UCSD) S. Muddu (Sanera Systems) A. Zelikovsky (Georgia State) Practical Approximation Algorithms.
Power-Aware Placement
ER UCLA UCLA ICCAD: November 5, 2000 Predictable Routing Ryan Kastner, Elaheh Borzorgzadeh, and Majid Sarrafzadeh ER Group Dept. of Computer Science UCLA.
EE4271 VLSI Design Interconnect Optimizations Buffer Insertion.
ABSTRACT We consider the problem of buffering a given tree with the minimum number of buffers under load cap and buffer skew constraints. Our contributions.
F.F. Dragan (Kent State) A.B. Kahng (UCSD) I. Mandoiu (Georgia Tech/UCLA) S. Muddu (Silicon Graphics) A. Zelikovsky (Georgia State) Provably Good Global.
Provably Good Global Buffering Using an Available Buffer Block Plan F. F. Dragan (Kent) A. B. Kahng (UCLA) I. Mandoiu (Gatech) S. Muddu (Silicon graphics)
UCLA TRIO Package Jason Cong, Lei He Cheng-Kok Koh, and David Z. Pan Cheng-Kok Koh, and David Z. Pan UCLA Computer Science Dept Los Angeles, CA
Symmetric Connectivity With Minimum Power Consumption in Radio Networks G. Calinescu (IL-IT) I.I. Mandoiu (UCSD) A. Zelikovsky (GSU)
Interconnect Optimizations
1 UCSD VLSI CAD Laboratory ISQED-2009 Revisiting the Linear Programming Framework for Leakage Power vs. Performance Optimization Kwangok Jeong, Andrew.
Non-tree Routing for Reliability & Yield Improvement A.B. Kahng – UCSD B. Liu – Incentia I.I. Mandoiu – UCSD Work supported by Cadence, MARCO GSRC, and.
A Global Minimum Clock Distribution Network Augmentation Algorithm for Guaranteed Clock Skew Yield A. B. Kahng, B. Liu, X. Xu, J. Hu* and G. Venkataraman*
EE4271 VLSI Design Advanced Interconnect Optimizations Buffer Insertion.
Processing Rate Optimization by Sequential System Floorplanning Jia Wang 1, Ping-Chih Wu 2, and Hai Zhou 1 1 Electrical Engineering & Computer Science.
6/29/ Routing Prof. Shiyan Hu Office: EERC 731.
ELEN 468 Lecture 271 ELEN 468 Advanced Logic Design Lecture 27 Interconnect Timing Optimization II.
Ion I. Mandoiu Ph.D. Defense of Research August 11, 2000 Approximation Algorithms for VLSI Routing.
Advanced Interconnect Optimizations. Timing Driven Buffering Problem Formulation Given –A Steiner tree –RAT at each sink –A buffer type –RC parameters.
Flow Models and Optimal Routing. How can we evaluate the performance of a routing algorithm –quantify how well they do –use arrival rates at nodes and.
Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Topics n Interconnect design. n Crosstalk. n Power optimization.
1 Introduction to Approximation Algorithms. 2 NP-completeness Do your best then.
Xin-Wei Shih and Yao-Wen Chang.  Introduction  Problem formulation  Algorithms  Experimental results  Conclusions.
1 Coupling Aware Timing Optimization and Antenna Avoidance in Layer Assignment Di Wu, Jiang Hu and Rabi Mahapatra Texas A&M University.
1 Introduction to Approximation Algorithms. 2 NP-completeness Do your best then.
A Polynomial Time Approximation Scheme For Timing Constrained Minimum Cost Layer Assignment Shiyan Hu*, Zhuo Li**, Charles J. Alpert** *Dept of Electrical.
An Efficient Clustering Algorithm For Low Power Clock Tree Synthesis Rupesh S. Shelar Enterprise Microprocessor Group Intel Corporation, Hillsboro, OR.
Thermal-aware Steiner Routing for 3D Stacked ICs M. Pathak and S.K. Lim Georgia Institute of Technology ICCAD 07.
Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Interconnect design. n Crosstalk. n Power optimization.
A Faster Approximation Scheme for Timing Driven Minimum Cost Layer Assignment Shiyan Hu*, Zhuo Li**, and Charles J. Alpert** *Dept of ECE, Michigan Technological.
ELEN 468 Lecture 271 ELEN 468 Advanced Logic Design Lecture 27 Gate and Interconnect Optimization.
1 ε -Optimal Minimum-Delay/Area Zero-Skew Clock Tree Wire-Sizing in Pseudo-Polynomial Time Jeng-Liang Tsai Tsung-Hao Chen Charlie Chung-Ping Chen (National.
Fast Algorithms for Slew Constrained Minimum Cost Buffering S. Hu*, C. Alpert**, J. Hu*, S. Karandikar**, Z. Li*, W. Shi* and C. Sze** *Dept of ECE, Texas.
Chris Chu Iowa State University Yiu-Chung Wong Rio Design Automation
Routing Tree Construction with Buffer Insertion under Obstacle Constraints Ying Rao, Tianxiang Yang Fall 2002.
© Yamacraw, 2002 Symmetric Minimum Power Connectivity in Radio Networks A. Zelikovsky (GSU) Joint work with Joint work with.
© Yamacraw, Fall 2002 Power Efficient Range Assignment in Ad-hoc Wireless Networks E. Althous (MPI) G. Calinescu (IL-IT) I.I. Mandoiu (UCSD) S. Prasad.
Prof. Shiyan Hu Office: EERC 518
A Fully Polynomial Time Approximation Scheme for Timing Driven Minimum Cost Buffer Insertion Shiyan Hu*, Zhuo Li**, Charles Alpert** *Dept of Electrical.
An Exact Algorithm for Difficult Detailed Routing Problems Kolja Sulimma Wolfgang Kunz J. W.-Goethe Universität Frankfurt.
A Fully Polynomial Time Approximation Scheme for Timing Driven Minimum Cost Buffer Insertion Shiyan Hu*, Zhuo Li**, Charles Alpert** *Dept of Electrical.
An O(bn 2 ) Time Algorithm for Optimal Buffer Insertion with b Buffer Types Authors: Zhuo Li and Weiping Shi Presenter: Sunil Khatri Department of Electrical.
Ion I. Mandoiu, Vijay V. Vazirani Georgia Tech Joseph L. Ganley Simplex Solutions A New Heuristic for Rectilinear Steiner Trees.
Confidential & Proprietary – All Rights Reserved Internal Distribution, October Quality of Service in Multimedia Distribution G. Calinescu (Illinois.
Chapter 7 – Specialized Routing
Buffer Insertion with Adaptive Blockage Avoidance
2 University of California, Los Angeles
Buffered tree construction for timing optimization, slew rate, and reliability control Abstract: With the rapid scaling of IC technology, buffer insertion.
RMST/RSMT Bookshelf Slot
Zero-Skew Trees Zero-Skew Tree: rooted tree in which all root-to-leaf paths have the same length Used in VLSI clock routing & network multicasting.
Performance-Driven Interconnect Optimization Charlie Chung-Ping Chen
Presentation transcript:

© Yamacraw, 2001 Minimum-Buffered Routing of Non-Critical Nets for Slew Rate and Reliability A. Zelikovsky GSU Joint work with C. Alpert (IBM), A. B. Kahng, B. Liu, I. Mandoiu (UCSD)

© Yamacraw, 2001 Abstract This poster introduces a new minimum-buffered routing problem formulation which requires that the capacitive load of each buffer and of the source driver be upper-bounded by a given constant. Our contributions include: - A linear time greedy algorithm for optimally buffering a given tree with a single non-inverting buffer type - A linear time dynamic programming algorithm for optimally buffering a given tree with a single inverting buffer type - A dynamic programming algorithm for optimally buffering a given tree under additional buffer skew constraints - Provably good algorithms with approximation ratios of 2(1+  ) and 4(1+  ) for simultaneous routing and buffering with single non-inverting, respectively inverting, buffer type - Heuristics with improved practical performance for simultaneous routing and buffering REFERENCES C. J. Alpert, A.B. Kahng, B. Liu, I. Mandoiu and A. Zelikovsky, “Minimum-Buffered Routing for Slew Rate and Reliability Control”, to appear in ICCAD-2001 C. Albrecht, A. B. Kahng, B. Liu, I. Mandoiu and A. Zelikovsky, “On the Skew Bounded Minimum Buffer Routing Tree Problem”, to appear in SASIMI-2001

© Yamacraw, 2001 Motivation In order to initiate meaningful placement and timing optimizations, any design flow requires early elimination of all electrical violations (e.g., cap load and slew violations), even for non-critical nets. Bounds on load caps - Serve as proxies for signal slew rate bound - Improve coupling noise immunity - Reduce delay uncertainty due to coupling noise - Improve reliability with respect to hot-carrier and AC self-heating effects - Facilitate technology migration since designs are more balanced - Guarantee bounded input rise/fall times at buffers and sinks To make progress with any methodology, it is crucial to have a fast and resource efficient method for fixing buffer load violations. Of particular interest are practical methods for buffering non-critical nets that have up to tens of thousands of sinks (e.g., scan enable). In clock-tree routing it is also necessary to bound the buffer skew, i.e., the difference between the maximum and the minimum number of buffers over all source-to-sink paths in a routing tree, since buffer skew directly affects the actual clock skew.

© Yamacraw, 2001 Given: net N with –Source r, sinks S –Input capacitance C s for each sink s in S –Unit length wire capacitance C w –Inverting or non-inverting buffer type, with Buffer input capacitance C b Load cap upper-bound C U –Sink polarities (optional) –Buffer-skew bound  (optional) Find: buffered routing tree for N such that –Load cap of each buffer and of the source r is at most C U –Sink polarity constraints are satisfied –Buffer-skew is at most  –The number of inserted buffers is minimized Tree buffered with inverters Tree with zero buffer-skew Bounded-load Buffered tree Min-Buffered Routing CUCU 0.75C U C w =C b =0 +C U +0.75C U C w =C b =0 CUCU 0.75C U C w =C b =0  =0

© Yamacraw, 2001 Optimal buffering of the rectilinear Steiner minimum tree (RSMT) is not always optimal Optimal solution not always on Hanan grid NP-hard to approximate within a constant factor better than 2 - Proof by reduction from the RSMT problem source Optimum solution source 62 3 Hanan grid solution 1 7 Optimum topology not on Hanan gridRSMT topology may be sub-optimal Hardness Results Buffered RSMT source 2 S3 4 S1 S RSMTOptimum source 2 S3 4 S1 S source 2 S3 4 S1 S C U = 8, sink/buffer input cap = 1 C U = 14, sink/buffer input cap = 0

© Yamacraw, 2001 Linear time greedy algorithm (extends tree-partition algorithm of Kundu&Misra): –Find a critical vertex p, i.e., a bottom-most vertex p such that c(T p ) > C U by a post-order traversal of the tree –Find a heaviest child u of p, i.e., a vertex u such that c(T u ) + c(u,p)  c(T v ) + c(v,p) for every other child v of p –Insert buffer b on edge (u,p) such that c(u,b) = min{C U -c(T u ), c(u,p)} –Recursively find an optimum buffering B’ of T -- T b –Return B = B’ U {b} Insert buffer on edge (u,p) if C U  c(T u )+c(u,p) Insert buffer at top of heaviest edge if C U > c(T u )+c(u,p) Non-Inverting Buffering

© Yamacraw, 2001 Linear time dynamic programming algorithm (DPI): –Traverse tree in postorder –Insert buffer b on edge (u,p) if c(T u ) < C U < c(T u ) + c(u,p) –For each branching point u Try to insert 0,1 or 2 buffers at the head of each branch (9 cases for binary tree) For each case –Check feasibility w.r.t. polarity constraints –Replace subtree u by an equivalent edge (u,v) with parameters ( , nb, rc), where  is polarity at u, nb is number of buffers and rc is residual capacitance of subtree u –find solutions with minimum number of buffers and topmost buffer polarity  =+/- –Find the solution at root with min number of buffers –Insert buffers in top-down order Inverting Buffering

© Yamacraw, 2001 Optimal dynamic programming algorithm (runs in O(n  3 OPT 2 ) time): - Traverse tree T in postorder - Buffer each edge if necessary - Buffer each branching point with all possible skew combinations - Return min-cost buffering Skew-Bounded Buffering Tellez and Sarrafzadeh (TCAD’97) suggest a greedy algorithm with runtime O(n+OPT), where n is the number of sinks and OPT is the optimum number of buffers. However, greedy is suboptimal for any buffer skew  > 0: Greedy bufferingOptimum buffering CUCU Buffer skew  = 1, sink input cap C u =C U, C v =C x =0.75C U Interconnect and buffer have zero cap 0.75C U CUCU

© Yamacraw, 2001 source 1 RSMT + KM source Fill heuristic Routing and Buffering Provably good algorithms: - Construct an  -approximate Steiner tree T - Apply the greedy KM algorithm on T - (Replace each buffer by 1 or 2 inverting buffers) Theorem: Approximation ratio is 2  (1+  ) for non- inverting, and 4  (1+  ) for inverting buffer type. Fill heuristic: - Repeat until source load cap < C U Find Steiner tree and add first buffer b using KM Fill b’s subtree with nearby sinks up to cap = C U Cut&Connect heuristic: - Find Steiner tree, add buffers using KM - For each buffer b with load cap < C U Cut b’s subtree, then reconnect it and relocate b such that driven cap is as close to C U as possible C U = 8, sink/buffer input cap = 1

© Yamacraw, 2001 Benchmark MST+KM MST+Cut&Connect MST+ Fill MST+DPI Lower #sinks C U #buffers runtime #buffers runtime #buffers runtime #buffers runtime Bound Fill, Cut&Connect and KM show different runtime/quality tradeoffs with the best quality achieved by Fill heuristic and the best runtime by KM Significant more buffers are needed with polarity constraints (but inverters are smaller than non-inverting buffers) Reference implementations are being added to the GSRC bookshelf to facilitate fast dissemination and easy comparison with future competing heuristics Experimental Results