Global Routing. 2 B (2, 6) A (2, 1) C (6, 4) B (2, 6) A (2, 1) C (6, 4) S (2, 4) Rectilinear Steiner minimum tree (RSMT) Rectilinear minimum spanning.

Slides:

Advertisements

Similar presentations

O(N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem Step 1: Divide the graph into  N sub-graph by clustering. Step 2: Solve each.

Advertisements

Efficient access to TIN Regular square grid TIN Efficient access to TIN Let q := (x, y) be a point. We want to estimate an elevation at a point q: 1. should.

TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.:

5/14/ Routing Prof. Shiyan Hu Office: EERC 731.

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.

Efficient Steiner Tree Construction Based on Spanning Graphs Hai Zhou Electrical and Computer Engineering Northwestern University.

Chapter 3 The Greedy Method 3.

1 Lecture 8: Voronoi Diagram Computational Geometry Prof. Dr. Th. Ottmann Voronoi Diagrams Definition Characteristics Size and Storage Construction Use.

1 Spanning Trees Lecture 20 CS2110 – Spring

Minimum-Buffered Routing of Non- Critical Nets for Slew Rate and Reliability Control Supported by Cadence Design Systems, Inc. and the MARCO Gigascale.

Graph Algorithms: Minimum Spanning Tree We are given a weighted, undirected graph G = (V, E), with weight function w:

38 th Design Automation Conference, Las Vegas, June 19, 2001 Creating and Exploiting Flexibility in Steiner Trees Elaheh Bozorgzadeh, Ryan Kastner, Majid.

3 -1 Chapter 3 The Greedy Method 3 -2 The greedy method Suppose that a problem can be solved by a sequence of decisions. The greedy method has that each.

Voronoi Diagrams Computational Geometry, WS 2006/07 Lecture 10 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik Fakultät.

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

Ant colony-based algorithm for constructing broadcasting tree with degree and delay constraints 晏廷.

An Interval MST Procedure Rebecca Nugent w/ Werner Stuetzle November 16, 2004.

A = p 4 B = p 5 CP = E[ p 7, p 2, p 3, p 6, p 1, p 8 ] S[p 4, p 5 ] d min = d 45 Plane Sweep Algorithm for Closest Pair Problem E=Event QueueS=Status Queue.

Circuit Simulation Based Obstacle-Aware Steiner Routing Yiyu Shi, Paul Mesa, Hao Yu and Lei He EE Department, UCLA Partially supported by NSF Career Award.

VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 5: Global Routing © KLMH Lienig © 2011 Springer Verlag 1 Chapter 5 – Global Routing.

Steiner trees Algorithms and Networks. Steiner Trees2 Today Steiner trees: what and why? NP-completeness Approximation algorithms Preprocessing.

Metal Layer Planning for Silicon Interposers with Consideration of Routability and Manufacturing Cost W. Liu, T. Chien and T. Wang Department of CS, NTHU,

VLSI Physical Design Automation Prof. David Pan Office: ACES Lecture 18. Global Routing (II)

Chapter 5 – Global Routing

Ion I. Mandoiu Ph.D. Defense of Research August 11, 2000 Approximation Algorithms for VLSI Routing.

CDCTree: Novel Obstacle-Avoiding Routing Tree Construction based on Current Driven Circuit Model Speaker: Lei He.

NetworkModel-1 Network Optimization Models. NetworkModel-2 Network Terminology A network consists of a set of nodes and arcs. The arcs may have some flow.

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

Introduction to Routing. The Routing Problem Apply after placement Input: –Netlist –Timing budget for, typically, critical nets –Locations of blocks and.

ECE260B – CSE241A Winter 2005 Routing

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.

1 CS612 Algorithms for Electronic Design Automation CS 612 – Lecture 7 Global Routing Mustafa Ozdal Computer Engineering Department, Bilkent University.

Shortest Path Algorithms. Kruskal’s Algorithm We construct a set of edges A satisfying the following invariant:  A is a subset of some MST We start with.

© The McGraw-Hill Companies, Inc., Chapter 3 The Greedy Method.

COSC 2007 Data Structures II Chapter 14 Graphs III.

Efficient Multi-Layer Obstacle- Avoiding Rectilinear Steiner Tree Construction Chung-Wei Lin, Shih-Lun Huang, Kai-Chi Hsu,Meng-Xiang Li, Yao-Wen Chang.

Module 5 – Networks and Decision Mathematics Chapter 23 – Undirected Graphs.

Placement. Physical Design Cycle Partitioning Placement/ Floorplanning Placement/ Floorplanning Routing Break the circuit up into smaller segments Place.

ARCHER:A HISTORY-DRIVEN GLOBAL ROUTING ALGORITHM Muhammet Mustafa Ozdal, Martin D. F. Wong ICCAD ’ 07.

ELEN 468 Lecture 271 ELEN 468 Advanced Logic Design Lecture 27 Gate and Interconnect Optimization.

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.

GLOBAL ROUTING Anita Antony PR11EC1011. Approaches for Global Routing Sequential Approach: – Route the nets one at a time. Concurrent Approach: – Consider.

Rectlinear Block Packing Using the O-tree Representation Yingxin Pang Koen Lampaert Mindspeed Technologies Chung-Kuan Cheng University of California, San.

Chris Chu Iowa State University Yiu-Chung Wong Rio Design Automation

Chapter 5 Guillotine Cut (2) Portals Ding-Zhu Du.

Prof. Shiyan Hu Office: EERC 518

Routing Topology Algorithms Mustafa Ozdal 1. Introduction How to connect nets with multiple terminals? Net topologies needed before point-to-point routing.

Trees Dr. Yasir Ali. A graph is called a tree if, and only if, it is circuit-free and connected. A graph is called a forest if, and only if, it is circuit-free.

1 CS612 Algorithms for Electronic Design Automation CS 612 – Lecture 7 Global Routing Mustafa Ozdal Computer Engineering Department, Bilkent University.

Prims Algorithm for finding a minimum spanning tree

1. For minimum vertex cover problem in the following graph give

STEINER TREE BASED ALGORITHMS. INTRODUCTION Maze routing and line probing algorithms cannot be used for multiterminal nets. There are several approaches.

Ion I. Mandoiu, Vijay V. Vazirani Georgia Tech Joseph L. Ganley Simplex Solutions A New Heuristic for Rectilinear Steiner Trees.

Spanning Trees Dijkstra (Unit 10) SOL: DM.2 Classwork worksheet Homework (day 70) Worksheet Quiz next block.

MATRIX FORM OF PRIM’S ALGORITHM. This network may be described using a Distance Matrix.

VLSI Physical Design Automation

VLSI Physical Design Automation

Voronoi Graph Voronoi region Vor(p) (p in set S) Voronoi Graph VOR(S)

Minimum Spanning Tree Chapter 13.6.

CMPS 3130/6130 Computational Geometry Spring 2017

Chapter 5 – Global Routing

Buffered tree construction for timing optimization, slew rate, and reliability control Abstract: With the rapid scaling of IC technology, buffer insertion.

Kruskal’s Algorithm for finding a minimum spanning tree

RMST/RSMT Bookshelf Slot

ICS 353: Design and Analysis of Algorithms

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.

CSE 332: Minimum Spanning Trees

FLUTE: Fast Lookup Table Based RSMT Algorithm for VLSI Design

Presentation transcript:

Global Routing

2 B (2, 6) A (2, 1) C (6, 4) B (2, 6) A (2, 1) C (6, 4) S (2, 4) Rectilinear Steiner minimum tree (RSMT) Rectilinear minimum spanning tree (RMST) Single Net Routing Single net routing:  Basis for full routing  Rectilinear routing

Rectilinear Routing  RMST by Prim’s Algorithm  O(p 2 )  p: number of terminals using methods such as  Starts with a single terminal and greedily adds least-cost edges to the partially-constructed tree  Advanced computational-geometric techniques reduce the runtime to O(p log p) 3

4 Characteristics of an RSMT  No. of Steiner points: 0 ≤ s ≤ p – 2 −p: No. of pins  The degree of any terminal pin is 1, 2, 3, or 4 −The degree of a Steiner point: 3 or 4  Always enclosed in the minimum bounding box (MBB) of the net  L RSMT  L MBB / 2 Rectilinear Routing

5 Transforming an initial RMST into a low-cost RSMT p1p1 p2p2 p3p3 p1p1 p3p3 p2p2 S1S1 p1p1 p3p3 p2p2 Construct L-shapes between points with (most) overlap of net segments p1p1 p3p3 S p2p2 Final tree (RSMT) Rectilinear Routing

6 Hanan grid:  Consists of the lines x = x p, y = y p that pass through the location (x p,y p ) of each terminal pin p  Maurice Hanan proved: −For finding Steiner points, it suffices to consider only intersections  At most (n 2 -n) candidates for Steiner points Rectilinear Routing

7 Hanan points ( ) RSMTIntersection lines Terminal pins Hanan Grid

8 Rectilinear Steiner Tree

9 Sequential Steiner Tree Heuristic Rectilinear Steiner Tree

10 A Sequential Steiner Tree Heuristic 1.Find the closest (in terms of rectilinear distance) pin pair, construct their minimum bounding box (MBB) 2.Find the closest point pair (p MBB,p C ) between any point p MBB on the MBB and p C from the set of pins to consider 3.Construct the MBB of p MBB and p C 4.Add the L-shape that p MBB lies on to T (deleting the other L-shape). If p MBB is a pin, then add any L-shape of the MBB to T. 5.Goto step 2 until the set of pins to consider is empty Steiner Tree Algorithm Finds RSMT for p ≤ 4

11

12 1 Sequential Steiner Tree Heuristic

Sequential Steiner Tree Heuristic

Sequential Steiner Tree Heuristic MBB pcpc

Sequential Steiner Tree Heuristic p MBB

Sequential Steiner Tree Heuristic

Sequential Steiner Tree Heuristic

Sequential Steiner Tree Heuristic

Sequential Steiner Tree Heuristic

Sequential Steiner Tree Heuristic