RMST/RSMT Bookshelf Slot

Slides:

Advertisements

Similar presentations

A R EVISIT TO THE P RIMAL -D UAL B ASED C LOCK S KEW S CHEDULING A LGORITHM Min Ni and Seda Ogrenci Memik EECS Department, Northwestern University.

Advertisements

Algorithm Design Methods (I) Fall 2003 CSE, POSTECH.

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.

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

1 Interconnect Layout Optimization by Simultaneous Steiner Tree Construction and Buffer Insertion Presented By Cesare Ferri Takumi Okamoto, Jason Kong.

S. J. Shyu Chap. 1 Introduction 1 The Design and Analysis of Algorithms Chapter 1 Introduction S. J. Shyu.

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

Ion Mandoiu (Georgia Tech) Alex Zelikovsky (Georgia State) ISMP 2000 Practical Approximation Algorithms for Zero- and Bounded-Skew Trees.

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.

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

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

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

F.F. Dragan (Kent State) A.B. Kahng (UCSD) I. Mandoiu (UCLA/UCSD) S. Muddu (Sanera Systems) A. Zelikovsky (Georgia State) Practical Approximation Algorithms.

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

CS333/ Topic 11 CS333 - Introduction CS333 - Introduction General information Goals.

2015/6/201 Minimum Spanning Tree Partitioning Algorithm for Microaggregation 報告者：林惠珍.

6/29/ Routing Prof. Shiyan Hu Office: EERC 731.

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

Grace Hopper Celebration of Women in Computing Evaluating Algorithmic Design Paradigms Sashka Davis Advised by Russell Impagliazzo UC San Diego October.

TECH Computer Science Graph Optimization Problems and Greedy Algorithms Greedy Algorithms  // Make the best choice now! Optimization Problems  Minimizing.

Multiples 1 X 2 = 22 X 2 = 43 X 2 = 6 4 X 2 = 8 What do you call 2,4,6,8 ?Multiples of 2 Why?

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.

Xin-Wei Shih and Yao-Wen Chang.  Introduction  Problem formulation  Algorithms  Experimental results  Conclusions.

Minimum Spanning Tree Given a weighted graph G = (V, E), generate a spanning tree T = (V, E’) such that the sum of the weights of all the edges is minimum.

Topics in Algorithms 2005 Constructing Well-Connected Networks via Linear Programming and Primal Dual Algorithms Ramesh Hariharan.

Solution to HW1. Problem 1 Need to find shortest path from a single source s to a single destination d. Have a condition in the Dijkstra algo loop which.

IO CONNECTION ASSIGNMENT AND RDL ROUTING FOR FLIP-CHIP DESIGNS Jin-Tai Yan, Zhi-Wei Chen 1 ASPDAC.2009.

Search by partial solutions.  nodes are partial or complete states  graphs are DAGs (may be trees) source (root) is empty state sinks (leaves) are complete.

Chapter 3 Restriction (1) Steiner Tree Ding-Zhu Du.

Lecture 12: Algorithm Review. General Problem Solving Methods Divide & Conquer Greedy Method Dynamic Programming Graph & Tree Traversal Backtracking Branch.

CS223 Advanced Data Structures and Algorithms 1 Review for Final Neil Tang 04/27/2010.

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

Factors Prime Factors Multiples Common Factors and Highest Common Factor (HCF) Factors and Multiples Common Multiples and Lowest Common Multiple (LCM)

Chapter 2. Optimal Trees and Paths Combinatorial Optimization

© Yamacraw, 2002 Symmetric Minimum Power Connectivity in Radio Networks A. Zelikovsky (GSU) Joint work with Joint work with.

Prof. Shiyan Hu Office: EERC 518

Zero Skew Clock Routing ECE 556 Project Proposal John Thompson Kurt Ting Simon Wong.

Steiner Tree Problem Given: A set S of points in the plane = terminals

1 CPSC 320: Intermediate Algorithm Design and Analysis July 14, 2014.

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

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

Improved Steiner Tree Approximation in Graphs SODA 2000 Gabriel Robins (University of Virginia) Alex Zelikovsky (Georgia State University)

Kruskal’s Algorithm for Computing MSTs Section 9.2.

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

Minimum Spanning Tree Chapter 13.6.

Lecture 5 Dynamic Programming

Lecture 21 Primal-Dual in Algorithms

Lecture 5 Dynamic Programming

مفاهيم طراحي الگوريتم مرتضي صاحب الزماني.

Connected Components Minimum Spanning Tree

Lecture 24 CSE 331 Oct 28, 2016.

Lecture 24 CSE 331 Oct 27, 2017.

Lecture 9 Greedy Strategy

Autumn 2015 Lecture 11 Minimum Spanning Trees (Part II)

Instruction Scheduling Hal Perkins Winter 2008

Minimum Spanning Trees

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

Lecture 25 CSE 331 Oct 27, 2014.

Primal-Dual Algorithm

Weighted Graphs & Shortest Paths

Autumn 2016 Lecture 10 Minimum Spanning Trees

Minimum Spanning Trees (MSTs)

The Minimum Cost Spanning Tree Problem

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.

Clock Tree Routing With Obstacles

Analysis of Algorithms

Prim’s algorithm for minimum spanning trees

Review for Final Neil Tang 05/01/2008

Linear Constrained Optimization

Presentation transcript:

RMST/RSMT Bookshelf Slot RMST/RSMT entries Rectilinear spanning trees Rectilenear Steiner trees Zero and bounded skew trees Buffered Steiner trees Reference implementations Multiple algorithms Experimental studies qualifying the range of applicability of each algorithm Sept. 7, 2001 GSRC Annual Review

Rectilinear MSTs Algorithms: O(n^2) Prim Hwang (rectilinear Voronoi diagram) Guibas-Stolfi (divide-and-conquer) Scheffer (quad-tree based range querries) Sept. 7, 2001 GSRC Annual Review

Algorithm Comparison Sept. 7, 2001 GSRC Annual Review

Rectilinear Steiner Trees Algorithms: Batched 1-Steiner (Robins) Edge-based heuristic (BOI) GeoSteiner (exact branch-and-cut) Rajogapalan-Vazirani (primal-dual) O(n log(n)) implementation of Zelikovsky’s algo Sept. 7, 2001 GSRC Annual Review

Buffered Steiner Trees Algorithms Exact algorithms for buffering a given tree under buffer load constraints Greedy for non-inverting buffers DP for inverting buffers + sink polarities Simultaneous tree construction and buffering Bounded buffer-skew Sept. 7, 2001 GSRC Annual Review

Bookshelf Continuous slot updates Interoperability/consistency E.g., new O(n log(n)) RMST algo in ASPDAC01 “Self-updating” bookshelf? Interoperability/consistency Slot-to-slot algoritm reuse keeps increasing Standard I/O formats and/or programming interfaces Consistency accross slots? Sept. 7, 2001 GSRC Annual Review

Technology File Formats GRID_UNIT 1.0 WIRE_UNIT_CAP 0.177 WIRE_UNIT_RES 0.015 NUM_BUFFER_TYPES 1 BUFFER noninverting1 INPUT_CAP 37.5 DRIVING_CAP 500.0 OUTPUT_RES 0.05 INVERTING_TYPE +1 CARDINALITY 30 Sept. 7, 2001 GSRC Annual Review