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.

Slides:

Advertisements

Similar presentations

MICRO-BUMP ASSIGNMENT FOR 3D ICS USING ORDER RELATION TA-YU KUAN, YI-CHUN CHANG, TAI-CHEN CHEN DEPARTMENT OF ELECTRICAL ENGINEERING, NATIONAL CENTRAL UNIVERSITY,

Advertisements

THERMAL-AWARE BUS-DRIVEN FLOORPLANNING PO-HSUN WU & TSUNG-YI HO Department of Computer Science and Information Engineering, National Cheng Kung University.

Group: Wilber L. Duran Duo (Steve) Liu

Constraint Driven I/O Planning and Placement for Chip-package Co-design Jinjun Xiong, Yiuchung Wong, Egino Sarto, Lei He University of California, Los.

Optimization of Placement Solutions for Routability Wen-Hao Liu, Cheng-Kok Koh, and Yih-Lang Li DAC’13.

Native-Conflict-Aware Wire Perturbation for Double Patterning Technology Szu-Yu Chen, Yao-Wen Chang ICCAD 2010.

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

Meng-Kai Hsu, Sheng Chou, Tzu-Hen Lin, and Yao-Wen Chang Electronics Engineering, National Taiwan University Routability Driven Analytical Placement for.

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.

National Tsing Hua University Po-Yang Hsu,Hsien-Te Chen,

Optimal Testing of Digital Microfluidic Biochips: A Multiple Traveling Salesman Problem R. Garfinkel 1, I.I. Măndoiu 2, B. Paşaniuc 2 and A. Zelikovsky.

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.

Row-Based Area-Array I/O Design Planning in Concurrent Chip-Package Design Flow R. Lee and H. Chen Department of EE NCTU, Taiwan ASPDAC 2011.

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

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

Layer Assignment Algorithm for RLC Crosstalk Minimization Bin Liu, Yici Cai, Qiang Zhou, Xianlong Hong Tsinghua University.

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

1 BoxRouter: A New Global Router Based on Box Expansion and Progressive ILP Minsik Cho and David Z. Pan ECE Dept. Univ. of Texas at Austin DAC 2006, July.

Supply Voltage Degradation Aware Analytical Placement Andrew B. Kahng, Bao Liu and Qinke Wang UCSD CSE Department {abk, bliu,

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

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

Floorplanning and Signal Assignment for Silicon Interposer-based 3D ICs W. H. Liu, M. S. Chang and T. C. Wang Department of Computer Science, NTHU, Taiwan.

A Resource-level Parallel Approach for Global-routing-based Routing Congestion Estimation and a Method to Quantify Estimation Accuracy Wen-Hao Liu, Zhen-Yu.

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

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

Chih-Hung Lin, Kai-Cheng Wei VLSI CAD 2008

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.

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

Global Routing.

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

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.

Solving Hard Instances of FPGA Routing with a Congestion-Optimal Restrained-Norm Path Search Space Keith So School of Computer Science and Engineering.

1 Global Routing Method for 2-Layer Ball Grid Array Packages Yukiko Kubo*, Atsushi Takahashi** * The University of Kitakyushu ** Tokyo Institute of Technology.

Wen-Hao Liu 1, Yih-Lang Li 1, and Kai-Yuan Chao 2 1 Department of Computer Science, National Chiao-Tung University, Hsin-Chu, Taiwan 2 Intel Architecture.

Low-Power Gated Bus Synthesis for 3D IC via Rectilinear Shortest-Path Steiner Graph Chung-Kuan Cheng, Peng Du, Andrew B. Kahng, and Shih-Hung Weng UC San.

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

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

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

Bus-Pin-Aware Bus-Driven Floorplanning B. Wu and T. Ho Department of Computer Science and Information Engineering NCKU GLSVLSI 2010.

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

AUTOMATIC BUS PLANNER FOR DENSE PCBS Hui Kong, Tan Yan and Martin D.F. Wong Department of Electrical and Computer Engineering, University of Illinois at.

Jason Cong‡†, Guojie Luo*†, Kalliopi Tsota‡, and Bingjun Xiao‡ ‡Computer Science Department, University of California, Los Angeles, USA *School of Electrical.

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

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

GLARE: Global and Local Wiring Aware Routability Evaluation Yaoguang Wei1, Cliff Sze, Natarajan Viswanathan, Zhuo Li, Charles J. Alpert, Lakshmi Reddy,

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

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.

A Negotiated Congestion based Router for Simultaneous Escape Routing Q.Ma, T.Yan and Martin D.F. Wong Department of Electrical and Computer Engineering.

Po-Wei Lee, Chung-Wei Lin, Yao-Wen Chang, Chin-Fang Shen, Wei-Chih Tseng NTU &Synopsys An Efficient Pre-assignment Routing Algorithm for Flip-Chip Designs.

Escape Routing of Mixed-Pattern Signals Based on Staggered-Pin- Array PCBs K. Wang, H. Wang and S. Dong Department of Computer Science & Technology, Tsinghua.

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.

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

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,

ILP-Based Inter-Die Routing for 3D ICs Chia-Jen Chang, Pao-Jen Huang, Tai-Chen Chen, and Chien-Nan Jimmy Liu Department of Electrical Engineering, National.

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

LEMAR: A Novel Length Matching Routing Algorithm for Analog and Mixed Signal Circuits H. Yao, Y. Cai and Q. Gao EDA Lab, Department of CS, Tsinghua University,

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

1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.

Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.

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

High-Performance Global Routing with Fast Overflow Reduction Huang-Yu Chen, Chin-Hsiung Hsu, and Yao-Wen Chang National Taiwan University Taiwan.

1 Double-Patterning Aware DSA Template Guided Cut Redistribution for Advanced 1-D Gridded Designs Zhi-Wen Lin and Yao-Wen Chang National Taiwan University.

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

Multi-Commodity Flow Based Routing

CS223 Advanced Data Structures and Algorithms

Under a Concurrent and Hierarchical Scheme

Presentation transcript:

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 Design

Outline 2 Introduction Problem formulation RDL routing algorithm Experimental results Conclusions

Introduction 3 The increasing complexity and decreasing feature size of VLSI designs make the demand of more I/O pads a significant problem to package technologies. An advanced packaging technology, the flip-chip (FC) package[Fig.1.(a)] is created for higher integration density and larger I/O counts. However, in recent IC designs, the I/O pads are still placed along the boundary of a die. This placement does not suit for the flip-chip package well. As a result, the top metal or an extra metal layer, called a Re-Distribution Layer (RDL)[Fig.1.(b)] is used to redistribute the wire-bonding pads to the bump pads without changing the placement of the I/O pads

Introduction 4

5 There are two kinds of the RDL routing problems for flip-chip design. 1.free-assignment routing :a router has the freedom to assign a wire-bonding pad to bump pads during routing. 2.pre-assignment routing :the mapping among wire-bonding pads and bump pads are defined before routing and can not be changed. ps: pre-assignment problem is more popular in practice since the functions of wire-bonding and bump pads are typically pre-defined by IC and packaging designers.

Problem formulation 6

7

8

9

10

Problem formulation 11 Problem 1 :The single-layer pre-assignment routing problem in the flip-chip design is to connect a set P of wire-bonding pads and a set B of bump pads according to pre- defined netlist with wire width and signal skew constrains so that no wire crosses each other, no signal skew constrain is violated, and the total wirelength is minimized under the 100% routability guarantee.

RDL routing algorithm 12 Algorithm overview

RDL routing algorithm 13 Notations and construct the routing network G: [global routing : ILP Formulation]

RDL routing algorithm 14 Notations: E: a set of edges which are the candidate segments of the global routing paths of nets. There are four types of edges: 1.the directed edge from a wire-bonding pad to a bump pad. 2.the directed edge from a wire-bonding pad to an ILP node. 3.the directed edge from an ILP node to a bump pad. 4.the directed edge from an ILP node to another ILP node. [global routing : ILP Formulation]

RDL routing algorithm 15 [global routing : ILP Formulation]

RDL routing algorithm 16 [global routing : ILP Formulation]

RDL routing algorithm 17 [global routing : ILP Formulation]

RDL routing algorithm 18 [global routing : ILP Formulation]

RDL routing algorithm 19 [global routing : ILP Formulation]

RDL routing algorithm 20 [global routing : ILP Formulation]

RDL routing algorithm Constraint (1): avoids the crossing Constraint (2): is used to avoid the congestion overflow of a tile. Constraint (3): avoids the congestion overflow of an interval between two pads.(for the edges passing through the same interval.) Constraint (4): formulates the signal-skew constraint between two nets. Constraint (5): guarantees that at least one edge of the wire- bonding pad p i of net n i be chosen. Constraint (6): flow conservation. 21 [global routing : ILP Formulation]

RDL routing algorithm Two ILP reduction techniques to reduce the size of network G and the number of variables and constraints in the ILP: (1).Constraint Graph Based Pruning (2).ILP Node Merging 22 [global routing:ILP reduction]

RDL routing algorithm 23 [ 出處 :2006 IEEE Monotonic Parallel and Orthogonal Routing for single-layer Ball Grid Array Package] A single netlist is monotonic if and only if nets on each row are in increasing order.

RDL routing algorithm (1).Constraint Graph Based Pruning: 24 [global routing:ILP reduction]

RDL routing algorithm 25 [global routing:ILP reduction]

RDL routing algorithm 26 [global routing:ILP reduction]

RDL routing algorithm 27 [global routing:ILP reduction]

RDL routing algorithm 28 [global routing:Non-monotonic]

RDL routing algorithm Passing point assignment :passing points are transformed from ILP nodes in order to distribute nets pass through the same interval, according to their wire widths and further signal-skew constraints. Net-Ordering Determination 29 [Detail routing:passing point and Net-order Determination]

RDL routing algorithm 30 [Detail routing:X-based Gridless Routing]

Experimental results 31 #Nets: the number of nets #Skew pairs: the number of matched nets with skew constrains #Wire widths: the number of variable wire widths #Rp: the number of wire-bonding rings #p: the number of the wire-bonding pad #Rb: the number of bump pad rings #b: the number of bump pads

Experimental results 32 Imp. Of CG(%):the reduction rate of the variables by using constrain graph pruning. Imp. Of NM(%):the reduction rate over the results listed in the Column “Imp. Of CG(%)” by using the ILP node merging. Total: the final resulting number of variables (constraints)

Experimental results 33

Conclusions 34 The first algorithm for the pre-assignment RDL routing problem, consider signal skews variable wire widths, U-turn routes, and total wirelength minimization.