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”

Slides:



Advertisements
Similar presentations
Analysis of Floorplanning Algorithm in EDA Tools
Advertisements

THERMAL-AWARE BUS-DRIVEN FLOORPLANNING PO-HSUN WU & TSUNG-YI HO Department of Computer Science and Information Engineering, National Cheng Kung University.
An Introduction to Matching and Layout Alan Hastings Texas Instruments
Clustering.
Lesson 08 Linear Programming
A Graph-Partitioning-Based Approach for Multi-Layer Constrained Via Minimization Yih-Chih Chou and Youn-Long Lin Department of Computer Science, Tsing.
An Effective Floorplanning Algorithm in Mixed Mode Placement Integrated with Rectilinear- Shaped Optimization for Soft Blocks Changqi Yang, Xianlong Hong,
A T HERMAL -D RIVEN F LOORPLANNING A LGORITHM FOR 3D IC S Jason Cong, Jie Wei, and Yan Zhang ICCAD
Linear Constraint Graph for Floorplan Optimization with Soft Blocks Jia Wang Electrical and Computer Engineering Illinois Institute of Technology Chicago,
3D-STAF: Scalable Temperature and Leakage Aware Floorplanning for Three-Dimensional Integrated Circuits Pingqiang Zhou, Yuchun Ma, Zhouyuan Li, Robert.
Meng-Kai Hsu, Sheng Chou, Tzu-Hen Lin, and Yao-Wen Chang Electronics Engineering, National Taiwan University Routability Driven Analytical Placement for.
A Size Scaling Approach for Mixed-size Placement Kalliopi Tsota, Cheng-Kok Koh, Venkataramanan Balakrishnan School of Electrical and Computer Engineering.
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.
1 Thermal Via Placement in 3D ICs Brent Goplen, Sachin Sapatnekar Department of Electrical and Computer Engineering University of Minnesota.
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.
Interconnect Estimation without Packing via ACG Floorplans Jia Wang and Hai Zhou Electrical & Computer Engineering Northwestern University U.S.A.
Fixed-outline Floorplanning Through Better Local Search
Placement 1 Outline Goal What is Placement? Why Placement?
CSE 6405 Graph Drawing Text Books T. Nishizeki and M. S. Rahman, Planar Graph Drawing, World Scientific, Singapore, G. Di Battista,
Supply Voltage Degradation Aware Analytical Placement Andrew B. Kahng, Bao Liu and Qinke Wang UCSD CSE Department {abk, bliu,
Generating Supply Voltage Islands In Core-based System-on-Chip Designs Final Presentation Steven Beigelmacher Gall Gotfried 04/26/2005.
Processing Rate Optimization by Sequential System Floorplanning Jia Wang 1, Ping-Chih Wu 2, and Hai Zhou 1 1 Electrical Engineering & Computer Science.
Triple Patterning Aware Detailed Placement With Constrained Pattern Assignment Haitong Tian, Yuelin Du, Hongbo Zhang, Zigang Xiao, Martin D.F. Wong.
CSE 144 Project Part 2. Overview Multiple rows Routing channel between rows Components of identical height but various width Goal: Implement a placement.
VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 3: Chip Planning © KLMH Lienig 1 Modern Floorplanning Based on B*-Tree and Fast.
Chip Planning 1. Introduction Chip Planning:  Deals with large modules with −known areas −fixed/changeable shapes −(possibly fixed locations for some.
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.
8/15/ VLSI Physical Design Automation Prof. David Pan Office: ACES Lecture 8. Floorplanning (2)
CSE 242A Integrated Circuit Layout Automation Lecture 5: Placement Winter 2009 Chung-Kuan Cheng.
Chih-Hung Lin, Kai-Cheng Wei VLSI CAD 2008
Global Routing. Global routing:  To route all the nets, should consider capacities  Sequential −One net at a time  Concurrent −Order-independent 2.
Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert.
Global Routing.
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.
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.
A Polynomial Time Approximation Scheme For Timing Constrained Minimum Cost Layer Assignment Shiyan Hu*, Zhuo Li**, Charles J. Alpert** *Dept of Electrical.
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.
Chapter 7 Transportation, Assignment & Transshipment Problems
Modern VLSI Design 3e: Chapters 1-3 week12-1 Lecture 30 Scale and Yield Mar. 24, 2003.
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.
Matrices Addition & Subtraction Scalar Multiplication & Multiplication Determinants Inverses Solving Systems – 2x2 & 3x3 Cramer’s Rule.
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.
Massachusetts Institute of Technology 1 L14 – Physical Design Spring 2007 Ajay Joshi.
The Fast Optimal Voltage Partitioning Algorithm For Peak Power Density Minimization Jia Wang, Shiyan Hu Department of Electrical and Computer Engineering.
Placement. Physical Design Cycle Partitioning Placement/ Floorplanning Placement/ Floorplanning Routing Break the circuit up into smaller segments Place.
Configurable Multi-product Floorplanning Qiang Ma, Martin D.F. Wong, Kai-Yuan Chao ASP-DAC 2010.
Paradigms for Graph Drawing Graph Drawing: Algorithms for the Visualization of Graphs - Chapter 2 Presented by Liana Diesendruck.
Hsing-Chih Chang Chien Hung-Chih Ou Tung-Chieh Chen Ta-Yu Kuan Yao-Wen Chang Double Patterning Lithography-Aware Analog Placement.
1 SYNTHESIS of PIPELINED SYSTEMS for the CONTEMPORANEOUS EXECUTION of PERIODIC and APERIODIC TASKS with HARD REAL-TIME CONSTRAINTS Paolo Palazzari Luca.
A Stable Fixed-outline Floorplanning Method Song Chen and Takeshi Yoshimura Graduate School of IPS, Waseda University March, 2007.
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,
Yen-Ting Yu Iris Hui-Ru Jiang Yumin Zhang Charles Chiang DRC-Based Hotspot Detection Considering Edge Tolerance and Incomplete Specification ICCAD’14.
Maze Routing Algorithms with Exact Matching Constraints for Analog and Mixed Signal Designs M. M. Ozdal and R. F. Hentschke Intel Corporation ICCAD 2012.
Implicit Hitting Set Problems Richard M. Karp Erick Moreno Centeno DIMACS 20 th Anniversary.
L10 – Map labeling algorithms NGEN06(TEK230) – Algorithms in Geographical Information Systems L10- Map labeling algorithms by: Sadegh Jamali (source: Lecture.
Copyright 2008 Koren ECE666/Koren Part.7b.1 Israel Koren Spring 2008 UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering Digital Computer.
Ramakrishna Lecture#2 CAD for VLSI Ramakrishna
Mathematical Vocabulary
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.
Partial Reconfigurable Designs
Chapter 7 – Specialized Routing
On-Chip Power Network Optimization with Decoupling Capacitors and Controlled-ESRs Wanping Zhang1,2, Ling Zhang2, Amirali Shayan2, Wenjian Yu3, Xiang Hu2,
Sequence Pair Representation
Sheqin Dong, Song Chen, Xianlong Hong EDA Lab., Tsinghua Univ. Beijing
An Introduction to Matching and Layout Alan Hastings Texas Instruments
Presentation transcript:

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”

2 Rectangular devices and blocks

3 I d1 and I d2 are considered to be identical based on the common-centroid placement. With the thermal gradient, I d1 and I d2 may become mismatched.

Floorplan representations  The absolute floorplan representation  B*-tree, hierarchical B*-tree  Sequence pair  Transitive closure graphs  Corner block list(CBL) for symmetry constrains  CBL and grid-based approaches for common- centroid constrains 4

 Among those works, only two addressed thermally constrained symmetric placement. 5

 Propose the first thermal-driven analog placement considering thermal device matching  Simultaneously place all devices, including power devices and thermally- sensitive matched devices with either the symmetry or the common-centroid constraint. 6

 Analog Placement  Desired Thermal Profile  Thermal-driven analog placement  Conclusion 7

8 Which one is more preferable for analog circuits? Placement should be not just well packed, but also should include analog-specific features such as regularity.

Symmetry constraint 9 Common-centroid constraint

 Lower temperature at thermal hot spots;  Smoother thermal gradients at the non- power device areas;  More separation between power and thermally-sensitive devices;  More regular isothermal contours in either the horizontal or the vertical direction such that the matched devices can easily be placed along the contours;  Larger accommodation areas for multiple thermally sensitive device groups. 10

11 Fig. 1(a) All power devices are evenly distributed at four sides of the chip. (b) All power devices are evenly distributed at two opposite sides of the chip.

12 Fig. 2(a) Thermal profile where power devices are evenly distributed at four sides of the chip. (b) Thermal profile where power devices are evenly distributed at two opposite sides of the chip. (b) is more desirable

It is always recommended to place non-power, thermally sensitive devices as far away from power devices as possible to alleviate thermal impacts from power devices. 13

14 Fig. 3 Placement configurations of power device area arrangements. (a)Power device area is arranged at one short side of the chip. (b)Power device areas are arranged at both short sides of the chip.

Inputs and Constraints  A set of device modules including power and non-power devices;  Power densities of all power devices;  The targeted aspect ratio of the placement area;  Symmetry and common-centroid constraints for all matching device groups; 15

16 Fig. 4 (a) Symmetric placement containing a symmetry group S0 = {bs3, (b4, b4)}, and two non-symmetric modules, b1 and b2. (b) Corresponding HB*-tree and ASF-B*-tree of the placement in (a). (ASF-automatically symmetric-feasible)

17 Fig. 5 An example of SA based algorithm

18 Fig. 6 Placement configuration and its corresponding HB*-trees. (a)Placement configuration based on the power area arrangement in Fig. 3. (b)HB*-trees representing the topology among the three regions in (a).

Formulation min: cost function, Ap -- Area of the bounding rectangle for the placement Wp -- Half-perimeter wire length Rp -- Difference between the aspect ratio of P and the targeted aspect ratio Tp -- Thermal cost of P 19

20 T l,max and T l,min denote the maximum and minimum temperatures at the left targeted isothermal contour; T r,max and T r,min denote the maximum and minimum temperatures at the right targeted isothermal contour.

 The previous works computed the thermal profile by calculating approximated thermal equations based on different thermal models.  Although it is fast to compute the thermal profile of a certain placement, it becomes inefficient during the simulated annealing process.  Look-up table to store the pre-simulated thermal profile. 21

22 Fig. 7 Coarse-grid and fine-grid thermal tables indicating the thermal profile of the power device with different precisions and scales.

 Thermal Halo Allocation 23 Effectively reduce the temperature at the thermal hot spots

 Global Thermal Profile Optimization 24 Coarse-grid thermal tables  Detailed Thermal Profile Optimization Fine-grid thermal tables Fig. 7 Placement of power devices is optimized based on (a) global and (b) detailed thermal profile optimization.

25 Symmetry device groups can simply be placed with their symmetry axes being perpendicular to the isothermal contours.

26 None of the previous works considers the thermal profile during the common-centroid placement.

27  Step 1: Pre-generate all possible common- centroid placements of each matching group  Step 2: Randomly select a candidate of the pre-generated placement when integrating with other devices  Step 3: Minimize the cost to get final candidates.

28 k-row TCCP Algorithm G cc = {b 1, b 2,..., b q } Each device b j has n b j sub-devices with identical size

29 k-row TCCP Algorithm  Evenly distribute the sub-devices of each device along the direction of the thermal gradient  Merge sub-devices on the same Eulerian trail  The column position of each sub-device in each row is assigned in a random order while keeping the symmetric row in the reverse order.

 Address the thermal issue in analog placement and studied the thermal-driven analog placement problem.  Simultaneously optimize the placements of power and non-power devices to generate a desired thermal profile for thermally-sensitive matched devices.  Propose an analog placement methodology that considers the best device matching under the thermal profile while satisfying the symmetry and the common-centroid constraints. 30

31