Pattern Selection based co-design of Floorplan and Power/Ground Network with Wiring Resource Optimization L. Li, Y. Ma, N. Xu, Y. Wang and X. Hong WuHan.

Slides:



Advertisements
Similar presentations
February 20, Spatio-Temporal Bandwidth Reuse: A Centralized Scheduling Mechanism for Wireless Mesh Networks Mahbub Alam Prof. Choong Seon Hong.
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.
THERMAL-AWARE BUS-DRIVEN FLOORPLANNING PO-HSUN WU & TSUNG-YI HO Department of Computer Science and Information Engineering, National Cheng Kung University.
Constraint Driven I/O Planning and Placement for Chip-package Co-design Jinjun Xiong, Yiuchung Wong, Egino Sarto, Lei He University of California, Los.
A Graph-Partitioning-Based Approach for Multi-Layer Constrained Via Minimization Yih-Chih Chou and Youn-Long Lin Department of Computer Science, Tsing.
Native-Conflict-Aware Wire Perturbation for Double Patterning Technology Szu-Yu Chen, Yao-Wen Chang ICCAD 2010.
An Effective Floorplanning Algorithm in Mixed Mode Placement Integrated with Rectilinear- Shaped Optimization for Soft Blocks Changqi Yang, Xianlong Hong,
Hsi-An Chien Ting-Chi Wang Redundant-Via-Aware ECO Routing ASPDAC2014.
3D-STAF: Scalable Temperature and Leakage Aware Floorplanning for Three-Dimensional Integrated Circuits Pingqiang Zhou, Yuchun Ma, Zhouyuan Li, Robert.
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,
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.
Power Grid Sizing via Convex Programming Peng Du, Shih-Hung Weng, Xiang Hu, Chung-Kuan Cheng University of California, San Diego 1.
Minimal Skew Clock Synthesis Considering Time-Variant Temperature Gradient Hao Yu, Yu Hu, Chun-Chen Liu and Lei He EE Department, UCLA Presented by Yu.
Path Finding for 3D Power Distribution Networks A. B. Kahng and C. K. Cheng UC San Diego Feb 18, 2011.
Routability-Driven Blockage-Aware Macro Placement Yi-Fang Chen, Chau-Chin Huang, Chien-Hsiung Chiou, Yao-Wen Chang, Chang-Jen Wang.
Supply Voltage Degradation Aware Analytical Placement Andrew B. Kahng, Bao Liu and Qinke Wang UCSD CSE Department {abk, bliu,
Maximizing the Lifetime of Wireless Sensor Networks through Optimal Single-Session Flow Routing Y.Thomas Hou, Yi Shi, Jianping Pan, Scott F.Midkiff Mobile.
Pei-Ci Wu Martin D. F. Wong On Timing Closure: Buffer Insertion for Hold-Violation Removal DAC’14.
1 Reconfigurable ECO Cells for Timing Closure and IR Drop Minimization TingTing Hwang Tsing Hua University, Hsin-Chu.
Chip Planning 1. Introduction Chip Planning:  Deals with large modules with −known areas −fixed/changeable shapes −(possibly fixed locations for some.
More Realistic Power Grid Verification Based on Hierarchical Current and Power constraints 2 Chung-Kuan Cheng, 2 Peng Du, 2 Andrew B. Kahng, 1 Grantham.
Mixed Non-Rectangular Block Packing for Non-Manhattan Layout Architectures M. Wu, H. Chen and J. Jou Department of EE, NCTU HsinChu, Taiwan ISQED 2011.
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.
CAFE router: A Fast Connectivity Aware Multiple Nets Routing Algorithm for Routing Grid with Obstacles Y. Kohira and A. Takahashi School of Computer Science.
Etron Project: Placement and Routing for Chip-Package-Board Co-Design
On-chip power distribution in deep submicron technologies
Topology aggregation and Multi-constraint QoS routing Presented by Almas Ansari.
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.
A novel approach of gateway selection and placement in cellular Wi-Fi system Presented By Rajesh Prasad.
BSG-Route: A Length-Matching Router for General Topology T. Yan and M. D. F. Wong University of Illinois at Urbana-Champaign ICCAD 2008.
A NEW ECO TECHNOLOGY FOR FUNCTIONAL CHANGES AND REMOVING TIMING VIOLATIONS Jui-Hung Hung, Yao-Kai Yeh,Yung-Sheng Tseng and Tsai-Ming Hsieh Dept. of Information.
Bus-Driven Floorplanning Hua Xiang*, Xiaoping Tang +, Martin D. F. Wong* * Univ. Of Illinois at Urbana-Champaign + Cadence Design Systems Inc.
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.
Regularity-Constrained Floorplanning for Multi-Core Processors Xi Chen and Jiang Hu (Department of ECE Texas A&M University), Ning Xu (College of CST Wuhan.
Ho-Lin Chang, Hsiang-Cheng Lai, Tsu-Yun Hsueh, Wei-Kai Cheng, Mely Chen Chi Department of Information and Computer Engineering, CYCU A 3D IC Designs Partitioning.
Statistical Sampling-Based Parametric Analysis of Power Grids Dr. Peng Li Presented by Xueqian Zhao EE5970 Seminar.
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.
Deferred Decision Making Enabled Fixed- Outline Floorplanner Jackey Z. Yan and Chris Chu DAC 2008.
Register Placement for High- Performance Circuits M. Chiang, T. Okamoto and T. Yoshimura Waseda University, Japan DATE 2009.
1. Placement of Digital Microfluidic Biochips Using the T-tree Formulation Ping-Hung Yuh 1, Chia-Lin Yang 1, and Yao-Wen Chang 2 1 Dept. of Computer Science.
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.
Configurable Multi-product Floorplanning Qiang Ma, Martin D.F. Wong, Kai-Yuan Chao ASP-DAC 2010.
Test Architecture Design and Optimization for Three- Dimensional SoCs Li Jiang, Lin Huang and Qiang Xu CUhk Reliable Computing Laboratry Department of.
Clock-Tree Aware Placement Based on Dynamic Clock-Tree Building Yanfeng Wang, Qiang Zhou, Xianlong Hong, and Yici Cai Department of Computer Science and.
1 A Fast Algorithm for Power Grid Design Jaskirat Singh Sachin Sapatnekar Department of Electrical and Computer Engineering University of Minnesota.
A Stable Fixed-outline Floorplanning Method Song Chen and Takeshi Yoshimura Graduate School of IPS, Waseda University March, 2007.
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.
1 Network Models Transportation Problem (TP) Distributing any commodity from any group of supply centers, called sources, to any group of receiving.
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.
Routability-driven Floorplanning With Buffer Planning Chiu Wing Sham Evangeline F. Y. Young Department of Computer Science & Engineering The Chinese University.
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,
By P.-H. Lin, H. Zhang, M.D.F. Wong, and Y.-W. Chang Presented by Lin Liu, Michigan Tech Based on “Thermal-Driven Analog Placement Considering Device Matching”
System in Package and Chip-Package-Board Co-Design
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
A Novel Timing-Driven Global Routing Algorithm Considering Coupling Effects for High Performance Circuit Design Jingyu Xu, Xianlong Hong, Tong Jing, Yici.
1 Chapter 5 Branch-and-bound Framework and Its Applications.
MICROPROCESSOR DESIGN1 IR/Inductive Drop Introduction One component of every chip is the network of wires used to distribute power from the input power.
Presented by Tae-Seok Kim
The minimum cost flow problem
ME 521 Computer Aided Design 15-Optimization
Revisiting and Bounding the Benefit From 3D Integration
Sheqin Dong, Song Chen, Xianlong Hong EDA Lab., Tsinghua Univ. Beijing
EDA Lab., Tsinghua University
Presentation transcript:

Pattern Selection based co-design of Floorplan and Power/Ground Network with Wiring Resource Optimization L. Li, Y. Ma, N. Xu, Y. Wang and X. Hong WuHan University, WuHan, China ASPDAC 2010

Outline Introduction Problem Formulation P/G Network Analysis Using Mesh Pattern P/G Network Aware Incremental Moves The Co-Design Algorithm Flow Experimental Results Conclusion

Introduction As the design complexity increases, it is necessary to handle the IR drop problem earlier in the design cycle Normally consider the following two factors:  The packing of modules influences the IR drop distribution of the whole chip greatly  Increasing wire width of P/G network can help to reduce IR drop, but the wiring resources are limited in modern designs

Introduction It is desired to consider the P/G network design during early physical design (e.g., floorplanning)

Problem Formulation The problem of floorplan and P/G network co- design is formulated as follows:  Given a floorplan of m modules, the number of power pads, the power consumption for each module  The objective is to obtain a feasible floorplan and simultaneously generate a corresponding P/G network with minimal wiring resource while the power constraints are satisfied

Problem Formulation Consider the power integrity constraints as follows: The IR-drop constraints:  For every P/G pin pi, its corresponding voltage V pi must satisfy:  V pi >= V min,k : for each power pin i of module k  V pi <= V max,k : for each ground pin i of module k  V min,k (V max,k ) is the minimum (maximum) voltage required for module k

Problem Formulation The minimum width constraints:  The width of a P/G line b i connecting nodes n i1 and n i2 must be greater than the minimum width in the given technology. The electromigration constraints:

Problem Formulation The overall cost function contains four terms: A(s): floorplan area W(s): total wirelength Ap(s): the metal resources used by P/G network in the constraint of IR drop and EM constraints Φ(s): the penalty function of the IR drop and EM constraints

P/G Network Analysis Using Mesh Pattern P/G Network Structure

P/G Network Analysis Using Mesh Pattern P/G Network Analysis  G is the conductance matrix for the resistors  x is the vector of node voltages  i is the vector of current loads

P/G Network Analysis Using Mesh Pattern P/G Mesh Patterns Establish a pattern table to record the Normally, the aspect ratio of a feasible floorplan is varied from 1:3 to 3:1 Create 16 kinds of P/G mesh network whose sizes are from 3*3 to 18*18

P/G Network Aware Incremental Moves The closer the P/G pin is placed to the power pad, the smaller IR drop we can get Give each circuit two power pads located on the left-bottom corner and top-right corner Use the SA-based algorithm with the B*-tree floorplan representation

P/G Network Aware Incremental Moves Modules 1 and 5, which are at level 1, are closer to the lower-left corner than modules 2, 6 and 9 To represent the topological distance to the upper- right corner, count the level reversely

P/G Network Aware Incremental Moves To fix the violations, move the violating modules towards the closer power pad When the left-bottom power pad is closer to the violating module, move a violating node to lower levels using the leftbottom_level representation Introduce two incremental moves:  Incre_Op1: select a violating node to swap with another node which is on lower levels  Incre_Op2: select a node on the lower levels and insert the violating node as the child of it

P/G Network Aware Incremental Moves If module 3 violates the IR-drop constraint The left-bottom power pad is close to module 3 Incre_Op1: choose a node on lower levels to swap, such as modules 0, 1, 5, … Incre_Op2: delete module 3, choose modules 0, 1 or 5 as the father of it

The Co-Design Algorithm Flow

Pattern Selection Given a feasible floorplan, find a mesh pattern whose aspect ratio is close to the given floorplan Scale the selected mesh pattern according to the floorplan

Pattern Selection First determine the aspect ratio of the mesh according to the given floorplan To obtain the minimal wiring resource, first choose the 3*3 mesh pattern with the aspect ratio Analyze the IR drop and EM constraints using the selected pattern If there are still violations in P/G network after wire sizing, change to another mesh pattern with the same aspect ratio

P/G Pin Assignment

When one module is near to the bottom-left corner, assign its P/G pin near to the bottom-left corner and vice versa Firstly handle the P/G pins of the modules which are far away from the corresponding power pad When a power node had been occupied by the other P/G pin, select the available power node nearby so that the distribution of P/G pins can be evened M2, M1, M3, M4

Wire Sizing for the P/G mesh network Worst_IR: the worst IR drop at the present Target_IR: the maximal allowable IR drop Worst_IR = Target_IR: no adjustment is needed Width_fact > 1: P/G network does not satisfy the IR drop constraint, the widths are broadened Width_fact < 1: narrow the width to minimize the P/G network wiring resource

Experimental Results

Conclusion This paper proposes a guided incremental floorplanning approach to amend the violations during the floorplanning process The P/G pin assignment and wire sizing method are also embedded in the floorplanning optimization process