CSE 144 Project Part 3.

Slides:

Advertisements

Similar presentations

VLSI DESIGN & COMPARABILITY GRAPHS By Deepak Katta.

Advertisements

An Introduction to Channel 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,

Ripple: An Effective Routability-Driven Placer by Iterative Cell Movement Xu He, Tao Huang, Linfu Xiao, Haitong Tian, Guxin Cui and Evangeline F.Y. Young.

Rajat K. Pal. Chapter 3 Emran Chowdhury # P Presented by.

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

ICS 252 Introduction to Computer Design Routing Fall 2007 Eli Bozorgzadeh Computer Science Department-UCI.

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.

A General Framework for Track Assignment in Multilayer Channel Routing (Multi layer routing) -VLSI Layout Algorithm KAZY NOOR –E- ALAM SIDDIQUEE

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

3.3 Multi-Layer V i+1 H i Channel Routing Presented by Zulfiquer Md. Mizanur Rhaman Student # p.

ECE Routing 1 ECE 665 Spring 2004 ECE 665 Spring 2004 Computer Algorithms with Applications to VLSI CAD Channel Routing Global Routing.

Multi-Layer Channel Routing Complexity and Algorithm Rajat K. Pal.

3.3 Multi-Layer V i+1 H i Channel Routing Presented by Md. Shaifur Rahman Student #

CSE241 Formal Verification.1Cichy, UCSD ©2003 CSE241A VLSI Digital Circuits Winter 2003 Recitation 5: File Formats.

Lecture 9: Multi-FPGA System Software October 3, 2013 ECE 636 Reconfigurable Computing Lecture 9 Multi-FPGA System Software.

A Specialized A* Algorithm. Specialized A* Algorithm As soon as a goal node is found, we may stop and return an optimal solution. In ordinary A* algorithm,

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

A452 – Programming project – Mark Scheme

Multi-Layer Channel Routing Complexity and Algorithm Rajat K. Pal.

CSE 144 Project Part 2. Overview Multiple rows Routing channel between rows Components of identical height but various width Goal: Implement a placement.

Chapter 5: Computational Complexity of Area Minimization in Multi-Layer Channel Routing and an Efficient Algorithm Presented by Md. Raqibul Hasan Std No.

7/13/ EE4271 VLSI Design VLSI Routing. 2 7/13/2015 Routing Problem Routing to reduce the area.

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

General Routing Overview and Channel Routing

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

LAN Overview (part 2) CSE 3213 Fall April 2017.

9/4/ VLSI Physical Design Automation Prof. David Pan Office: ACES Detailed Routing (I)

Area-I/O Flip-Chip Routing for Chip-Package Co-Design Progress Report 方家偉、張耀文、何冠賢 The Electronic Design Automation Laboratory Graduate Institute of Electronics.

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

Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Topics n Standard cell-based layout. n Channel routing. n Simulation.

Global Routing.

TSV-Aware Analytical Placement for 3D IC Designs Meng-Kai Hsu, Yao-Wen Chang, and Valerity Balabanov GIEE and EE department of NTU DAC 2011.

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

Modern VLSI Design 3e: Chapters 1-3 week12-1 Lecture 30 Scale and Yield Mar. 24, 2003.

BSG-Route: A Length-Matching Router for General Topology T. Yan and M. D. F. Wong University of Illinois at Urbana-Champaign ICCAD 2008.

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

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

4. Combinational Logic Networks Layout Design Methods 4. 2

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.

Fishbone: A Block-Level Placement and Routing Scheme Fan Mo and Robert K. Brayton EECS, UC Berkeley.

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

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

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

Penn ESE535 Spring DeHon 1 ESE535: Electronic Design Automation Day 13: March 3, 2015 Routing 1.

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

Graph Coloring. Vertex Coloring problem in VLSI routing channels Standard cells Share a track Minimize channel width- assign horizontal Metal wires to.

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

1 CS612 Algorithms for Electronic Design Automation CS 612 – Lecture 8 Lecture 8 Network Flow Based Modeling Mustafa Ozdal Computer Engineering Department,

An Exact Algorithm for Difficult Detailed Routing Problems Kolja Sulimma Wolfgang Kunz J. W.-Goethe Universität Frankfurt.

CSE 144 Project. Overall Goal of the Project Implement a physical design tool for a two- row standard cell design

EE4271 VLSI Design VLSI Channel Routing.

CALTECH CS137 Fall DeHon 1 CS137: Electronic Design Automation Day 21: November 28, 2005 Routing 1.

VLSI Physical Design Automation

VLSI Physical Design Automation

We will be studying the architecture of XC3000.

ESE535: Electronic Design Automation

ECE 556 Project Presentation

By Santhosh Reddy Katkoori

Placement and Routing With Congestion Control

Optimal Non-Manhattan Bubble Sort Channel Router

EE4271 VLSI Design, Fall 2016 VLSI Channel Routing.

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

VLSI Physical Design Automation

ICS 252 Introduction to Computer Design

Under a Concurrent and Hierarchical Scheme

Management Information Systems

Material Requirements Planning and Enterprise Resource Planning.

Presentation transcript:

CSE 144 Project Part 3

Overview Goal: Implement a routing tool for standard cell design Starts with the placement results Specifies positions of wires that connect pins

Routing Model Regular-net routing Feed-through routing Regular nets: wires within each channel Fabrication model: 2-layer VH model Feed-through routing Feed-throughs: wires crossing multiple channels Fabrication model Separate (the third) metal layer for vertical wires Horizontal wires share the same layer with regular nets

Feed-through Routing Goal: Specify the assignment of horizontal feed-through wires to the channels Model each channel as a big track Problem solved using channel routing algorithm Pin locations may NOT necessarily be at the edges of the big channel

Regular-net Routing Goal: Specify the routing configuration within each channel A typical channel routing problem Routing process needs to take into account the feed-through wires Vertical feed-through wires: Routed in a separate layer No contributions to horizontal/vertical constraints Horizontal feed-through wires: Routed in the same layer with horizontal regular wires Contribute to horizontal constraints No contribution to vertical constraints due to the absence of pins

Core Algorithm and Handling of Exception Cases Both stages modeled as channel routing problem --- the Yoshimura-Kuh algorithm is used Exception case: loops in vertical constraints Solution: output a message indicating the detection of the loop, and immediately proceed to the routing of the next channel In feed-through routing: Possible exception case: fixed channel (big track) quantity --- might be insufficient for fulfilling horizontal&vertical constraints of feed-throughs Solution: proceed to regular-net routing immediately, and ignore feed-through wires in regular-net routing phase

Output Specification Format Net i : (PinPosition1, PinPosition2,...) [LeftmostPosition, RightmostPosition] TrackNumber