Modern VLSI Design 2e: Chapter 7 Copyright  1998 Prentice Hall PTR Topics n Block placement. n Global routing. n Switchbox routing.

Slides:

Advertisements

Similar presentations

Analysis of Floorplanning Algorithm in EDA Tools

Advertisements

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

FPGA-Based System Design: Chapter 4 Copyright  2004 Prentice Hall PTR Topics n Logic synthesis. n Placement and routing.

Wen-Hao Liu1, Yih-Lang Li, and Cheng-Kok Koh Department of Computer Science, National Chiao-Tung University School of Electrical and Computer Engineering,

Ch.7 Layout Design Standard Cell Design TAIST ICTES Program VLSI Design Methodology Hiroaki Kunieda Tokyo Institute of Technology.

Modern VLSI Design 2e: Chapter 8 Copyright  1998 Prentice Hall PTR Topics n High-level synthesis. n Architectures for low power. n Testability and architecture.

Modern VLSI Design 4e: Chapter 8 Copyright  2008 Wayne Wolf Topics High-level synthesis. Architectures for low power. GALS design.

FPGA-Based System Design: Chapter 6 Copyright  2004 Prentice Hall PTR Register-transfer Design n Basics of register-transfer design: –data paths and controllers.

Modern VLSI Design 3e: Chapter 10 Copyright  2002 Prentice Hall Adapted by Yunsi Fei ECE 300 Advanced VLSI Design Fall 2006 Lecture 24: CAD Systems &

Paul Falkenstern and Yuan Xie Yao-Wen Chang Yu Wang Three-Dimensional Integrated Circuits (3D IC) Floorplan and Power/Ground Network Co-synthesis ASPDAC’10.

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.

Toward Better Wireload Models in the Presence of Obstacles* Chung-Kuan Cheng, Andrew B. Kahng, Bao Liu and Dirk Stroobandt† UC San Diego CSE Dept. †Ghent.

Multiobjective VLSI Cell Placement Using Distributed Simulated Evolution Algorithm Sadiq M. Sait, Mustafa I. Ali, Ali Zaidi.

Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania ECE VLSI Circuit Design Lecture 21 - Floorplanning.

Modern VLSI Design 2e: Chapter4 Copyright  1998 Prentice Hall PTR.

CS294-6 Reconfigurable Computing Day 8 September 17, 1998 Interconnect Requirements.

Penn ESE535 Spring DeHon 1 ESE535: Electronic Design Automation Day 21: April 15, 2009 Routing 1.

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.

Routing 1 Outline –What is Routing? –Why Routing? –Routing Algorithms Overview –Global Routing –Detail Routing –Shortest Path Algorithms Goal –Understand.

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Topics n Shifters. n Adders and ALUs.

Penn ESE535 Spring DeHon 1 ESE535: Electronic Design Automation Day 19: April 9, 2008 Routing 1.

Routing 2 Outline –Maze Routing –Line Probe Routing –Channel Routing Goal –Understand maze routing –Understand line probe routing.

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.

General Routing Overview and Channel Routing

Register-Transfer (RT) Synthesis Greg Stitt ECE Department University of Florida.

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

Global Routing. Global routing:  To route all the nets, should consider capacities  Sequential −One net at a time  Concurrent −Order-independent 2.

Global Routing.

Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation.

FPGA-Based System Design: Chapter 6 Copyright  2004 Prentice Hall PTR Topics n Design methodologies.

Massachusetts Institute of Technology 1 L14 – Physical Design Spring 2007 Ajay Joshi.

FPGA-Based System Design: Chapter 3 Copyright  2004 Prentice Hall PTR FPGA Fabric n Elements of an FPGA fabric –Logic element –Placement –Wiring –I/O.

FPGA-Based System Design: Chapter 3 Copyright  2004 Prentice Hall PTR Topics n FPGA fabric architecture concepts.

Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Combinational network delay. n Logic optimization.

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

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

Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Interconnect design. n Crosstalk. n Power optimization.

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.

FPGA-Based System Design: Chapter 4 Copyright  2003 Prentice Hall PTR Topics n Number representation. n Shifters. n Adders and ALUs.

Topics Design methodologies. Kitchen timer example.

Topics Combinational network delay.

Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation.

1 A Min-Cost Flow Based Detailed Router for FPGAs Seokjin Lee *, Yongseok Cheon *, D. F. Wong + * The University of Texas at Austin + University of Illinois.

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

Topics Architecture of FPGA: Logic elements. Interconnect. Pins.

CALTECH CS137 Winter DeHon CS137: Electronic Design Automation Day 13: February 20, 2002 Routing 1.

Detailed Routing مرتضي صاحب الزماني.

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

Modern VLSI Design 3e: Chapter 7 Copyright  1998, 2002 Prentice Hall PTR Topics n Power/ground routing. n Clock routing. n Floorplanning tips. n Off-chip.

Maze Routing Algorithms with Exact Matching Constraints for Analog and Mixed Signal Designs M. M. Ozdal and R. F. Hentschke Intel Corporation ICCAD 2012.

FPGA-Based System Design: Chapter 1 Copyright  2004 Prentice Hall PTR Moore’s Law n Gordon Moore: co-founder of Intel. n Predicted that number of transistors.

FPGA-Based System Design: Chapter 7 Copyright  2004 Prentice Hall PTR Topics n Multi-FPGA systems.

Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Topics n Combinational network delay. n Logic optimization.

Modern VLSI Design 3e: Chapter 8 Copyright  1998, 2002 Prentice Hall PTR Topics n Basics of register-transfer design: –data paths and controllers; –ASM.

FPGA-Based System Design: Chapter 6 Copyright  2004 Prentice Hall PTR Topics n Low power design. n Pipelining.

Modern VLSI Design 3e: Chapter 3 Copyright  1998, 2002 Prentice Hall PTR Topics n Wire delay. n Buffer insertion. n Crosstalk. n Inductive interconnect.

VLSI Floorplanning and Planar Graphs prepared and Instructed by Shmuel Wimer Eng. Faculty, Bar-Ilan University July 2015VLSI Floor Planning and Planar.

FPGA Routing Pathfinder [Ebeling, et al., 1995] Introduced negotiated congestion During each routing iteration, route nets using shortest.

A Novel Timing-Driven Global Routing Algorithm Considering Coupling Effects for High Performance Circuit Design Jingyu Xu, Xianlong Hong, Tong Jing, Yici.

Register-Transfer (RT) Synthesis Greg Stitt ECE Department University of Florida.

FPGA-Based System Design: Chapter 3 Copyright  2004 Prentice Hall PTR Topics n FPGA fabric architecture concepts.

6 Resource Utilization 4/28/2017 Teaching Strategies

VLSI Physical Design Automation

VLSI Physical Design Automation

Chapter 5 – Global Routing

EE4271 VLSI Design, Fall 2016 VLSI Channel Routing.

Register-Transfer (RT) Synthesis

VLSI Physical Design Automation

ICS 252 Introduction to Computer Design

Presentation transcript:

Modern VLSI Design 2e: Chapter 7 Copyright  1998 Prentice Hall PTR Topics n Block placement. n Global routing. n Switchbox routing.

Modern VLSI Design 2e: Chapter 7 Copyright  1998 Prentice Hall PTR Floorplanning strategies n Floorplanning must take into account blocks of varying function, size, shape. n Must design: –space allocation; –signal routing; –power supply routing; –clock distribution.

Modern VLSI Design 2e: Chapter 7 Copyright  1998 Prentice Hall PTR Bricks-and-mortar floorplan blocks

Modern VLSI Design 2e: Chapter 7 Copyright  1998 Prentice Hall PTR Purposes of floorplanning n Early in design: –Prepare a floorplan to budget area, wire area/delay. Tradeoffs between blocks can be negotiated. n Late in design: –Make sure the pieces fit together as planned. –Implement the global layout.

Modern VLSI Design 2e: Chapter 7 Copyright  1998 Prentice Hall PTR Types of routing n Channel routing: –channel may grow in one dimension to accommodate wires; –pins generally on only two sides. n Switchbox routing: –cannot grow in any dimension; –pins are on all four sides, fixing dimensions of the box.

Modern VLSI Design 2e: Chapter 7 Copyright  1998 Prentice Hall PTR Channels and switchboxes

Modern VLSI Design 2e: Chapter 7 Copyright  1998 Prentice Hall PTR Block placement n Blocks have: –area; –aspect ratio. n Blocks may be placed at different rotations and reflections. n Uniform size blocks are easier to interchange.

Modern VLSI Design 2e: Chapter 7 Copyright  1998 Prentice Hall PTR Blocks and wiring n Cannot ignore wiring during block placement - large wiring areas may force rearrangement of blocks. n Wiring plan must consider area and delay of critical signals. n Blocks divide wiring area into routing channels.

Modern VLSI Design 2e: Chapter 7 Copyright  1998 Prentice Hall PTR Channel definition n Channels end at block boundaries. n Several alternate channel definitions are possible:

Modern VLSI Design 2e: Chapter 7 Copyright  1998 Prentice Hall PTR Channel definition changes with block spacing Changing spacing changes relationship between block edges:

Modern VLSI Design 2e: Chapter 7 Copyright  1998 Prentice Hall PTR

Modern VLSI Design 2e: Chapter 7 Copyright  1998 Prentice Hall PTR Channel graph

Modern VLSI Design 2e: Chapter 7 Copyright  1998 Prentice Hall PTR Channel graph usage n Nodes are channels, edges placed between two channels that touch. n Channel graph shows paths between channels. n Channel graph can be used to guide global routing.

Modern VLSI Design 2e: Chapter 7 Copyright  1998 Prentice Hall PTR Channels must be routed in order Wire out of end of one channel creates pin on side of next channel: channel A channel B constraint

Modern VLSI Design 2e: Chapter 7 Copyright  1998 Prentice Hall PTR Windmills Can create an unroutable combination of channels with circular constraints:

Modern VLSI Design 2e: Chapter 7 Copyright  1998 Prentice Hall PTR

Modern VLSI Design 2e: Chapter 7 Copyright  1998 Prentice Hall PTR Slicable floorplan

Modern VLSI Design 2e: Chapter 7 Copyright  1998 Prentice Hall PTR Slicability property n A slicable floorplan can be recursively cut in two without cutting any blocks. n A slicable floorplan is guaranteed to have no windmills, therefore guaranteed to have a feasible order of routing for the channels. n Slicability is a desirable property for floorplans.

Modern VLSI Design 2e: Chapter 7 Copyright  1998 Prentice Hall PTR Global routing n Goal: assign wires to paths through channels. n Don’t worry about exact routing of wires within channel. n Can estimate channel height from global routing using congestion.

Modern VLSI Design 2e: Chapter 7 Copyright  1998 Prentice Hall PTR Line probe routing n Heuristic method for finding a short route. n Works with arbitrary combination of obstacles. n Does not explore all possible paths - not optimal.

Modern VLSI Design 2e: Chapter 7 Copyright  1998 Prentice Hall PTR Line probe example A A line 1 line 2

Modern VLSI Design 2e: Chapter 7 Copyright  1998 Prentice Hall PTR Channel utilization n Want to keep all channels about equally full to minimize wasted area. n Important to route time-critical signals first. n Shortest path may not be best for global wiring. n In general, may need to rip-up wires and reroute to improve the global routing.

Modern VLSI Design 2e: Chapter 7 Copyright  1998 Prentice Hall PTR Switchbox routing n Can’t expand a switchbox to make room for more wiring. n Switchbox may be defined by intersection of channels.

Modern VLSI Design 2e: Chapter 7 Copyright  1998 Prentice Hall PTR Routing order and switchboxes Switchboxes frequently need more experimentation with wiring order because nets may block other nets: