Physical Design Routing Driven Design Closure 1. Algorithms and Data Structures for Fast Routing to Handle Increasing Design Complexity Dirk Mueller (Post-doctoral.

Slides:

Advertisements

Similar presentations

Chuck Alpert Design Productivity Group Austin Research Laboratory

Advertisements

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.

Cambridge University Engineering Department VLSI Design Third Year Standard Project - SB1 Second Mini Lecture Web page: 12th.

Cadence Design Systems, Inc. Why Interconnect Prediction Doesn’t Work.

Timing Constraints: Are they constraining designs or designers? Subramanyam Sripada Synopsys Inc 3/13/2015.

Buffer and FF Insertion Slides from Charles J. Alpert IBM Corp.

Xing Wei, Wai-Chung Tang, Yu-Liang Wu Department of Computer Science and Engineering The Chinese University of HongKong

ECE 6466 “IC Engineering” Dr. Wanda Wosik

1 Physical Hierarchy Generation with Routing Congestion Control Chin-Chih Chang *, Jason Cong *, Zhigang (David) Pan +, and Xin Yuan * * UCLA Computer.

Tanuj Jindal ∗, Charles J. Alpert‡, Jiang Hu ∗, Zhuo Li‡, Gi-Joon Nam‡, Charles B. Winn‡‡ ∗ Department of ECE, Texas A&M University, College Station, Texas.

Institute of Applied Microelectronics and Computer Engineering College of Computer Science and Electrical Engineering, University of Rostock Slide 1 Spezielle.

DCDL The Design Constraints Description Language An Emerging OVI Standard.

1 A Lithography-friendly Structured ASIC Design Approach By: Salman Goplani* Rajesh Garg # Sunil P Khatri # Mosong Cheng # * National Instruments, Austin,

MCFRoute: A Detailed Router Based on Multi- Commodity Flow Method Xiaotao Jia, Yici Cai, Qiang Zhou, Gang Chen, Zhuoyuan Li, Zuowei Li.

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

Interconnect Optimizations. A scaling primer Ideal process scaling: –Device geometries shrink by  = 0.7x) Device delay shrinks by  –Wire geometries.

EE4271 VLSI Design Interconnect Optimizations Buffer Insertion.

VLSI Routing. Routing Problem  Given a placement, and a fixed number of metal layers, find a valid pattern of horizontal and vertical wires that connect.

Interconnect Optimizations

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.

Next-generation Chips & Computing with Atoms Igor Markov ACAL / EECS, Univ. of Michigan.

Can Recursive Bisection Alone Produce Routable Placements? Andrew E. Caldwell Andrew B. Kahng Igor L. Markov Supported by Cadence.

Cost-Based Tradeoff Analysis of Standard Cell Designs Peng Li Pranab K. Nag Wojciech Maly Electrical and Computer Engineering Carnegie Mellon University.

ENEE 644 Dr. Ankur Srivastava Office: 1349 A.V. Williams URL: Computer-Aided Design of.

Combining High Level Synthesis and Floorplan Together EDA Lab, Tsinghua University Jinian Bian.

A Methodology for Interconnect Dimension Determination By: Jeff Cobb Rajesh Garg Sunil P Khatri Department of Electrical and Computer Engineering, Texas.

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.

Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Topics n Interconnect design. n Crosstalk. n Power optimization.

CRISP: Congestion Reduction by Iterated Spreading during Placement Jarrod A. Roy†‡, Natarajan Viswanathan‡, Gi-Joon Nam‡, Charles J. Alpert‡ and Igor L.

Global Routing.

CAD for Physical Design of VLSI Circuits

Etron Project: Placement and Routing for Chip-Package-Board Co-Design

A Polynomial Time Approximation Scheme For Timing Constrained Minimum Cost Layer Assignment Shiyan Hu*, Zhuo Li**, Charles J. Alpert** *Dept of Electrical.

VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 5: Global Routing © KLMH Lienig 1 EECS 527 Paper Presentation High-Performance.

Archer: A History-Driven Global Routing Algorithm Mustafa Ozdal Intel Corporation Martin D. F. Wong Univ. of Illinois at Urbana-Champaign Mustafa Ozdal.

New Modeling Techniques for the Global Routing Problem Anthony Vannelli Department of Electrical and Computer Engineering University of Waterloo Waterloo,

CMP 4202: VLSI System Design Lecturer: Geofrey Bakkabulindi

VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 5: Global Routing © KLMH Lienig 1 EECS 527 Paper Presentation Techniques for Fast.

Thermal-aware Steiner Routing for 3D Stacked ICs M. Pathak and S.K. Lim Georgia Institute of Technology ICCAD 07.

CSE 494: Electronic Design Automation Lecture 2 VLSI Design, Physical Design Automation, Design Styles.

IEEE Central Texas Section CEDA Chapter CEDA Chapter l The petition to form the CEDA chapter was submitted on Dec, 31, 2011 and the chapter was approved.

Kwangsoo Han‡, Andrew B. Kahng‡† and Hyein Lee‡

Text Book: Silicon VLSI Technology Fundamentals, Practice and Modeling Authors: J. D. Plummer, M. D. Deal, and P. B. Griffin Class: ECE 6466 “IC Engineering”

VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 6: Detailed Routing © KLMH Lienig 1 What Makes a Design Difficult to Route Charles.

ARCHER:A HISTORY-DRIVEN GLOBAL ROUTING ALGORITHM Muhammet Mustafa Ozdal, Martin D. F. Wong 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.

Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Topics n CAD systems. n Simulation. n Placement and routing. n Layout analysis.

ECE 260B – CSE 241A /UCB EECS Kahng/Keutzer/Newton Physical Design Flow Read Netlist Initial Placement Placement Improvement Cost Estimation Routing.

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

Simultaneous Analog Placement and Routing with Current Flow and Current Density Considerations H.C. Ou, H.C.C. Chien and Y.W. Chang Electronics Engineering,

Physical Synthesis Buffer Insertion, Gate Sizing, Wire Sizing,

Routing Tree Construction with Buffer Insertion under Obstacle Constraints Ying Rao, Tianxiang Yang Fall 2002.

System in Package and Chip-Package-Board Co-Design

Dirk Stroobandt Ghent University Electronics and Information Systems Department A New Design Methodology Based on System-Level Interconnect Prediction.

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.

An O(nm) Time Algorithm for Optimal Buffer Insertion of m Sink Nets Zhuo Li and Weiping Shi {zhuoli, Texas A&M University College Station,

Stick Diagrams Stick Diagrams electronics.

EE4271 VLSI Design VLSI Channel Routing.

EMT 351/4 DIGITAL IC DESIGN Week # 1 EDA & HDL.

Gopakumar.G Hardware Design Group

VLSI Physical Design Automation

Chapter 1 – Introduction

Chapter 7 – Specialized Routing

Sheqin Dong, Song Chen, Xianlong Hong EDA Lab., Tsinghua Univ. Beijing

EE4271 VLSI Design, Fall 2016 VLSI Channel Routing.

Department of Computer Science and Technology

Presentation transcript:

Physical Design Routing Driven Design Closure 1. Algorithms and Data Structures for Fast Routing to Handle Increasing Design Complexity Dirk Mueller (Post-doctoral Researcher) DEUniv. of Bonn bonn.de Bonn n/a US Shankar Krishnamoorthy Mentor Graphics Corp. shankar_krishnamo San Jose CA 2. Guiding a Physical Design Closure System to Produce Easier-to-Route Designs with More Predictable Timing Zhuo Li (Research Staff Member) USIBM Corp. Austin TX 3. Rule Agnostic Routing by Using Design Fabrics Gyuszi Suto (Engineer) USIntel Corp. Hillsboro OR

US Charles Alpert IBM Corp. Austin TX With each subsequent technology node, routing complexity increases exponentially to handle the explosion of design rules and routing constraints. Metal layer stacks are becoming increasingly complex, with varying degrees of wire widths and interconnect parasitics becoming the norm. This session discusses design closure from a routing-centric perspective from three angles: core routing technology, guiding physical design to create a friendlier hand-off to routing, and reducing routing complexity by changing the underlying methodology. Gyuszi Suto graduated from the Technical University of Cluj-Napoca Romania in 1987 with a Master’s Degree In Computer Engineering. He joined Intel in 1993 and has worked on 3 generations of VLSI routers as architect, main developer and mentor to new team members. For the past 6 years, he has mainly focused on physical design rule modeling of the Intel process technology. Zhuo Li received the Ph.D. degree in computer engineering from Texas A&M University, College Station, in Dr. Li is currently a Research Staff Member in IBM Austin Research Laboratory. He received several IBM technical/invention awards including three IBM Outstanding Technical Achievement Awards, and filed 31 patents with 8 issued. He has published over 50 conference and journal papers, and is a recipient of the ASPDAC Best Paper Award in and the IEEE CAS Outstanding Young Author Award. Zhuo has spent the last seven years developing algorithms for buffering, routing, sizing, and vt optimization within IBM's design closure environment. Dirk Mueller received his Ph.D. in 2009 from the University of Bonn for his work on global and detailed routing. Since then he has been a post-doctoral researcher at the University of Bonn working on a full blown router that has been used in the production of several VLSI chips. His expertise lies in using an non-traditional resource sharing algorithm for the global routing engine.

1. Algorithms and Data Structures for Fast Routing to Handle Increasing Design Complexity We present advanced data structures and algorithms for fast and high-quality global and detailed routing in modern technologies based on a combinatorial approximation scheme for min-max resource sharing. Detailed routing uses exact shortest path algorithms, based on a shape-based data structure for pin access and a two-level track-based data structure for long-distance connections. 2. Guiding a Physical Design Closure System to Produce Easier-to-Route Designs Physical synthesis has emerged as one of the most important tools in design closure, which starts with the logic synthesis step and generates a new optimized netlist and its layout for the final signoff process. A traditional physical synthesis tool optimizes timing/area/power with the assumption that each net can be routed with an optimal Steiner tree. However, advanced design rules, more IP and hierarchical design styles for billion-gate designs, serious buffering problems from interconnect scaling and metal layer stacks make routing a much more challenging problem. This paper discusses techniques that may relieve this problem, and guide the physical design closure system to produce not only easier to route designs, but also better timing quality. 3. Rule Agnostic Routing by Using Design Fabrics Moore's law poses a tremendous challenge on how to print and manufacture these ever- shrinking physical components, generation after process generation. One aspect of this challenge is that the process rules are exploding in complexity, directly translating into EDA tool complexity. Traditional design rules governed the spacing, overlap or alignment of any two layout objects from this set: diffusion, poly, via cut, wire, etc. Our solution relies on grids (aka. Fabrics), models the design rules on those grids and presents them to the EDA tools in such a way that it minimizes the complexity cost on the tools' side. In an ideal situation, the proposed solution can completely decouple the tools from the process rules, i.e. even if the tools don't change at all, they'll still be able to support new process nodes.