Clock Tree Routing With Obstacles

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

OCV-Aware Top-Level Clock Tree Optimization
Spring 08, Mar 11 ELEC 7770: Advanced VLSI Design (Agrawal) 1 ELEC 7770 Advanced VLSI Design Spring 2008 Zero - Skew Clock Routing Vishwani D. Agrawal.
4/22/ Clock Network Synthesis Prof. Shiyan Hu Office: EREC 731.
1 Interconnect Layout Optimization by Simultaneous Steiner Tree Construction and Buffer Insertion Presented By Cesare Ferri Takumi Okamoto, Jason Kong.
National Tsing Hua University Po-Yang Hsu,Hsien-Te Chen,
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 Useful Skew Tree Framework for Inserting Large Safety Margins Rickard Ewetz and Cheng-Kok Koh School of Electrical and Computer Engineering, Purdue University.
VLSI Physical Design: From Graph Partitioning to Timing Closure Paper Presentation © KLMH Lienig 1 EECS 527 Paper Presentation Topological Design of Clock.
Path Finding for 3D Power Distribution Networks A. B. Kahng and C. K. Cheng UC San Diego Feb 18, 2011.
Design of Variable Input Delay Gates for Low Dynamic Power Circuits
38 th Design Automation Conference, Las Vegas, June 19, 2001 Creating and Exploiting Flexibility in Steiner Trees Elaheh Bozorgzadeh, Ryan Kastner, Majid.
1 A Tree Based Router Search Engine Architecture With Single Port Memories Author: Baboescu, F.Baboescu, F. Tullsen, D.M. Rosu, G. Singh, S. Tullsen, D.M.Rosu,
ER UCLA UCLA ICCAD: November 5, 2000 Predictable Routing Ryan Kastner, Elaheh Borzorgzadeh, and Majid Sarrafzadeh ER Group Dept. of Computer Science UCLA.
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.
Interconnect Optimizations
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.
SLIP 2000April 9, Wiring Layer Assignments with Consistent Stage Delays Andrew B. Kahng (UCLA) Dirk Stroobandt (Ghent University) Supported.
1 ENTITY test is port a: in bit; end ENTITY test; DRC LVS ERC Circuit Design Functional Design and Logic Design Physical Design Physical Verification and.
Chih-Hung Lin, Kai-Cheng Wei VLSI CAD 2008
Introduction to Routing. The Routing Problem Apply after placement Input: –Netlist –Timing budget for, typically, critical nets –Locations of blocks and.
MGR: Multi-Level Global Router Yue Xu and Chris Chu Department of Electrical and Computer Engineering Iowa State University ICCAD
A Topology-based ECO Routing Methodology for Mask Cost Minimization Po-Hsun Wu, Shang-Ya Bai, and Tsung-Yi Ho Department of Computer Science and Information.
Area-I/O Flip-Chip Routing for Chip-Package Co-Design Progress Report 方家偉、張耀文、何冠賢 The Electronic Design Automation Laboratory Graduate Institute of Electronics.
Authors: Jia-Wei Fang,Chin-Hsiung Hsu,and Yao-Wen Chang DAC 2007 speaker: sheng yi An Integer Linear Programming Based Routing Algorithm for Flip-Chip.
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)
On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms National.
Global Routing.
An Efficient Clustering Algorithm For Low Power Clock Tree Synthesis Rupesh S. Shelar Enterprise Microprocessor Group Intel Corporation, Hillsboro, OR.
BSG-Route: A Length-Matching Router for General Topology T. Yan and M. D. F. Wong University of Illinois at Urbana-Champaign ICCAD 2008.
Thermal-aware Steiner Routing for 3D Stacked ICs M. Pathak and S.K. Lim Georgia Institute of Technology ICCAD 07.
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.
Physical Synthesis Buffer Insertion, Gate Sizing, Wire Sizing,
Spring 2014, Mar 17...ELEC 7770: Advanced VLSI Design (Agrawal)1 ELEC 7770 Advanced VLSI Design Spring 2014 Zero - Skew Clock Routing Vishwani D. Agrawal.
Routing Tree Construction with Buffer Insertion under Obstacle Constraints Ying Rao, Tianxiang Yang Fall 2002.
Maze Routing Algorithms with Exact Matching Constraints for Analog and Mixed Signal Designs M. M. Ozdal and R. F. Hentschke Intel Corporation ICCAD 2012.
LEMAR: A Novel Length Matching Routing Algorithm for Analog and Mixed Signal Circuits H. Yao, Y. Cai and Q. Gao EDA Lab, Department of CS, Tsinghua University,
Pipelined and Parallel Computing Partition for 1 Hongtao Du AICIP Research Nov 3, 2005.
1ISPD'03 Process Variation Aware Clock Tree Routing Bing Lu Cadence Jiang Hu Texas A&M Univ Gary Ellis IBM Corp Haihua Su IBM Corp.
CSE 248 Skew 1Kahng, UCSD 2011 CSE248 Spring 2011 Skew.
Zero Skew Clock Routing ECE 556 Project Proposal John Thompson Kurt Ting Simon Wong.
1 Timing Closure and the constant delay paradigm Problem: (timing closure problem) It has been difficult to get a circuit that meets delay requirements.
VLSI Physical Design Automation
Partial Reconfigurable Designs
Memory Segmentation to Exploit Sleep Mode Operation
Chapter 7 – Specialized Routing
VLSI Physical Design Automation
Dijkstra’s shortest path Algorithm
COSC160: Data Structures Linked Lists
James D. Z. Ma Department of Electrical and Computer Engineering
Revisiting and Bounding the Benefit From 3D Integration
Buffer Insertion with Adaptive Blockage Avoidance
ELEC 7770 Advanced VLSI Design Spring 2016 Zero-Skew Clock Routing
Performance Optimization Global Routing with RLC Crosstalk Constraints
Buffered tree construction for timing optimization, slew rate, and reliability control Abstract: With the rapid scaling of IC technology, buffer insertion.
EE5780 Advanced VLSI Computer-Aided Design
Introduction Basic formulations Applications
332:578 Deep Submicron VLSI Design Lecture 14 Design for Clock Skew
Topics Logic synthesis. Placement and routing..
Sungho Kang Yonsei University
Reducing Clock Skew Variability via Cross Links
Routing Algorithms.
Chapter 6 Network Flow Models.
VLSI Physical Design Automation
Zero Skew Clock tree Implementation
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.
INTRODUCTION TO NETWORK FLOWS
ELEC 7770 Advanced VLSI Design Spring 2010 Zero-Skew Clock Routing
Presentation transcript:

Clock Tree Routing With Obstacles A final project for ECE556 Cho, Minsik Fan, Jiong Kim, Sanghoo

Introduction With feature size shrinking to the sub-micron stage and increasing of system frequency, clock speed becomes more critical Clock performance directly implicate the system performance

Introduction (cont’d) Design a “good” clock signal distribution network becomes more and more challenging Skew has to be dealt with even the margin of error becomes more and more critical Concept of useful skew is being looked at Design a “good” clock tree with obstacles is even more challenging!!!

Problem Definition Problem Definition: For a given set of clock sinks {S}, and a given set of obstacles {OBS} Find a zero-skew solution {P} that connected all the sinks in {S} in a 2-D grid such that {{S} U {P}} ∩ {OBS} = 0 {S}, {P} and {OBS} is a set of x-y coordinates in 2-D grid Example solution is show on the right

Algorithm Five stage algorithm Each stage has its own detailed algorithm The entire algorithm will be very heavily based on heuristics

Rough Partition Objective: Input & Output: To assemble the partitions such that there is no obstacles in the middle of the partition Input & Output: Input: set of sinks {S} and set of obstacles {OBS} with in the boundary of {S} Output: Bi-partition of {S}, {S1} and {S2} such that {S1} U {S2} = {S} {S1} ∩ {S2} = 0

Rough Partition – continue Rough Partition phase will finish when there is no obstacles left in to be partitioned This phase is used to avoid as much obstacles as possible We are calling it “Obstacles Avoidance Partition”

Rough Partition – example

Topology Generation Objective: Input & Output: Find the good match on set of sinks from bottom up Input & Output: Input: set of sinks {s} in a partition from OAP phase Output: Tree representation {Ts} of such set of sinks

Routing Tree Construction Objective: Construct a set of zero skew trees Input & Output: Input: set of partition {P} and its tree representation {Ts} Output: set of zero skew trees {ZST}

Tree – Bottom up phase During the Bottom up phase tasks similar to DME is performed

Tree – Top down phase Top down phase selects the zero skew point

Tree – Routing with Obstacles At first, try to connect the two point directly Whenever we meet a obstacle, try contour the obstacle by depth-first searching try the shortest path corner of the obstacle first

Tree Merging Bottom up approach Objective: Input & Output: To select the “best” matching pair of sub-trees produced in the previous stage Input & Output: Input: set of sub-tree {ZTS} Output: merged tree {MT}

Tree Merging Clock delay

Tree Merging Clock source

Tree Merging What if? There is no pair that can be connected because of too big skew - Divide 2 trees into 4 trees and retry Final result does not meet the spec - Retry tree merging till the result can meet the spec

Tree Merging Routing Will route around obstacles

Tree Balancing Top down approach Objective: Input & Output: To minimize the skew on each clock path Input & Output: Input: tree {MT} from Tree Merging phase and set of sinks {S} Output: balanced skew tree {TB}

Assumptions Uniform wire size Uniform sink size Same resistance and capacitance per unit of length Uniform sink size All sinks has same size, i.e., 1um x 1um

Workload Distribution All the algorithms were discussed between team members before implementation phase OAP and topology generation – Jiong Fan Routing Tree Construction – Sanghoon Kim Tree Merging – Minsik Cho Tree Balancing – ?? To be assigned May not be implemented Random Obstacles Generation – ?? May test with fixed set of obstacles first

Testing methodology Using the input file for Steiner tree homework Input file format ------- Resistance per um | ---- Capacitance per um | | 0.003 2.0e-17 boundary: 0 0 70000 69984 // Upper left and lower right coordinates of die (um) nrClkPins= 267 // Total number of nodes 0 29322 41420 5.9e-14 // Node 1 : position x,y and node capacitance 1 26208 51579 3.5e-14 // Node 2 2 35565 61661 5.3e-14 // Node 3 .

Feather improvement Study the improvement by incorporate wire sizing and buffer insertion in the tree balancing stage Reduction on clock delay, thus increasing on clock frequency

Reference “Exact Zero Skew” Ran-Song Tsay IEEE Int. Conference on Computer-Aided Design (ICCAD-91), pp. 336- 339, Nov. 1991. “Zero Skew Clock Routing with Minimum Wirelength” T.-H. Chao, Y.-C. Hsu, J.-M. Ho, K. D. Boese, and A. B. Kahng, IEEE Trans. Circuits Syst. -II, pp. 799- 814, 1992. “More Practical Bounded-Skew Clock Routing” A. B. Kahng and C.-W. A. Tsao Proc. 34th ACM/IEEE Design Automation Conf., pp. 594-599, 1997. “UST/DME: A Clock Tree Router For General Skew Constraints” C.-W. A. Tsao and C.-K Koh, Proc. IEEE Intl. Conf. on Computer Aided Design, 2000

Thank you! Thank you!