A T HERMAL -D RIVEN F LOORPLANNING A LGORITHM FOR 3D IC S Jason Cong, Jie Wei, and Yan Zhang ICCAD 2004 1.

Slides:



Advertisements
Similar presentations
Optimal Bus Sequencing for Escape Routing in Dense PCBs H.Kong, T.Yan, M.D.F.Wong and M.M.Ozdal Department of ECE, University of Illinois at U-C ICCAD.
Advertisements

THERMAL-AWARE BUS-DRIVEN FLOORPLANNING PO-HSUN WU & TSUNG-YI HO Department of Computer Science and Information Engineering, National Cheng Kung University.
A Graph-Partitioning-Based Approach for Multi-Layer Constrained Via Minimization Yih-Chih Chou and Youn-Long Lin Department of Computer Science, Tsing.
3D-STAF: Scalable Temperature and Leakage Aware Floorplanning for Three-Dimensional Integrated Circuits Pingqiang Zhou, Yuchun Ma, Zhouyuan Li, Robert.
A Novel Cell Placement Algorithm For Flexible TFT Circuit With Mechanical Strain And Temperature Consideration Jiun-Li Lin, Po-Hsun Wu, and Tsung-Yi Ho.
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.
Krit Athikulwongse, Dae Hyun Kim, Moongon Jung, and Sung Kyu Lim
An Optimal Algorithm of Adjustable Delay Buffer Insertion for Solving Clock Skew Variation Problem Juyeon Kim, Deokjin Joo, Taehan Kim DAC’13.
1 Thermal Via Placement in 3D ICs Brent Goplen, Sachin Sapatnekar Department of Electrical and Computer Engineering University of Minnesota.
Routability-Driven Blockage-Aware Macro Placement Yi-Fang Chen, Chau-Chin Huang, Chien-Hsiung Chiou, Yao-Wen Chang, Chang-Jen Wang.
Interconnect Estimation without Packing via ACG Floorplans Jia Wang and Hai Zhou Electrical & Computer Engineering Northwestern University U.S.A.
1 DAOmap: A Depth-optimal Area Optimization Mapping Algorithm for FPGA Designs Deming Chen, Jacon Cong ICCAD 2004 Presented by: Wei Chen.
NuCAD ACG - Adjacent Constraint Graph for General Floorplans Hai Zhou and Jia Wang ICCD 2004, San Jose October 11-13, 2004.
3D CMP and 3D IC Physical Design Flow Jason Cong and Guojie Luo University of California, Los Angeles {cong, cong,
Processing Rate Optimization by Sequential System Floorplanning Jia Wang 1, Ping-Chih Wu 2, and Hai Zhou 1 1 Electrical Engineering & Computer Science.
Analytical Thermal Placement for VLSI Lifetime Improvement and Minimum Performance Variation Andrew B. Kahng †, Sung-Mo Kang ‡, Wei Li ‡, Bao Liu † † UC.
Temperature-Aware Design Presented by Mehul Shah 4/29/04.
Delay and Power Optimization with TSV-aware 3D Floorplanning M. A. Ahmed and M. Chrzanowska-Jeske Portland State University, Oregon, USA ISQED 2014.
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.
CDCTree: Novel Obstacle-Avoiding Routing Tree Construction based on Current Driven Circuit Model Speaker: Lei He.
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.
L i a b l eh kC o m p u t i n gL a b o r a t o r y On Effective and Efficient In-Field TSV Repair for Stacked 3D ICs Presenter: Li Jiang Li Jiang †, Fangming.
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.
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.
Physical Planning for the Architectural Exploration of Large-Scale Chip Multiprocessors Javier de San Pedro, Nikita Nikitin, Jordi Cortadella and Jordi.
Power Reduction for FPGA using Multiple Vdd/Vth
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.
Lecture 12 Review and Sample Exam Questions Professor Lei He EE 201A, Spring 2004
1 Modern Floorplanning Based on Fast Simulated Annealing Tung-Chieh Chen* and Yao-Wen Chang* # Graduate Institute of Electronics Engineering* Department.
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.
1 Global Routing Method for 2-Layer Ball Grid Array Packages Yukiko Kubo*, Atsushi Takahashi** * The University of Kitakyushu ** Tokyo Institute of Technology.
Johann Knechtel, Igor L. Markov and Jens Lienig University of Michigan, EECS Department, Ann Arbor USA Dresden University of Technology, EE Department,
An evaluation of HotSpot-3.0 block-based temperature model
An Efficient Clustering Algorithm For Low Power Clock Tree Synthesis Rupesh S. Shelar Enterprise Microprocessor Group Intel Corporation, Hillsboro, OR.
Efficient Multi-Layer Obstacle- Avoiding Rectilinear Steiner Tree Construction Chung-Wei Lin, Shih-Lun Huang, Kai-Chi Hsu,Meng-Xiang Li, Yao-Wen Chang.
Modern Floor-planning Based on B ∗ -Tree and Fast Simulated Annealing Paper by Chen T. C. and Cheng Y. W (2006) Presented by Gal Itzhak
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.
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.
RF network in SoC1 SoC Test Architecture with RF/Wireless Connectivity 1. D. Zhao, S. Upadhyaya, M. Margala, “A new SoC test architecture with RF/wireless.
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.
Test Architecture Design and Optimization for Three- Dimensional SoCs Li Jiang, Lin Huang and Qiang Xu CUhk Reliable Computing Laboratry Department of.
Hsing-Chih Chang Chien Hung-Chih Ou Tung-Chieh Chen Ta-Yu Kuan Yao-Wen Chang Double Patterning Lithography-Aware Analog Placement.
TSV-Constrained Micro- Channel Infrastructure Design for Cooling Stacked 3D-ICs Bing Shi and Ankur Srivastava, University of Maryland, College Park, MD,
Routing Tree Construction with Buffer Insertion under Obstacle Constraints Ying Rao, Tianxiang Yang Fall 2002.
Chin-Hsiung Hsu, Yao-Wen Chang, and Sani Rechard Nassif From ICCAD09.
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.
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”
ISPD 2001, Sonoma County, April 3rd, Consistent Floorplanning with Super Hierarchical Constraints Yukiko KUBO, Shigetoshi NAKATAKE, and Yoji KAJITANI.
Inductance Screening and Inductance Matrix Sparsification 1.
1 Floorplanning of Pipelined Array (FoPA) Modules using Sequence Pairs Matt Moe Herman Schmit.
Interconnect Characteristics of 2.5-D System Integration Scheme Yangdong (Steven) Deng & Wojciech P. Maly
The Annealing Algorithm Revisited L.P.P.P. van Ginneken DigiPen Institute of Technology.
The Early Days of Automatic Floorplan Design
Partial Reconfigurable Designs
An Automated Design Flow for 3D Microarchitecture Evaluation
Self-protection experiment
Department of Computer Science and Technology
Presentation transcript:

A T HERMAL -D RIVEN F LOORPLANNING A LGORITHM FOR 3D IC S Jason Cong, Jie Wei, and Yan Zhang ICCAD

OUTLINE Introduction Problem formulation 3D thermal-driven floorplanning algorithm Experimental results Conclusion 2

I NTRODUCTION 3 Motivation for 3D ICs Reduce interconnect delays Source: Proc of the IEEE, 2001

I NTRODUCTION 4 Different 3D technologies Chip level integration Block level integration (this paper focus) Cell level integration(over 500k) Chip level Block level Cell level

I NTRODUCTION The current thermal models: 1. Numerical computing methods such as FEM(Finite Element Method)[8] and FDM(Finite Difference Methods)[21][22] 2. Compact resistive network[20] 3. Simplified closed-form formula[6][14] Time-consuming :1>2>3 Accurate:1>2>3 5

P ROBLEM FORMULATION 6

7

3D FLOORPLANNING ALGORITHM 2D floorplanning algorithm: sequence pair[18],BSG[16],B*-Tree[4],O- Tree[11],CBL[12],TCG[17],etc. 3D floorplanning algorithm[CBA(Combined Bucket and 2D Array)]: 2D floorplanning algorithm + a bucket structure 2D floorplanning(TCG[17]): is used to represent each layer A bucket structure: is posed on the circuit stack 8

3D FLOORPLANNING ALGORITHM TCG(Transitive Closure Graphs [DAC 2001]): two constraint graphs : horizontal and vertical graph. 9

3D FLOORPLANNING ALGORITHM A bucket structure: IB(i) : In each bucket i, indexes of the blocks that intersect with the bucket are stored. IBT(j) : each block j stores indexes to all the buckets that overlap with the block. 10 Die3 Die2 Die1

3D FLOORPLANNING ALGORITHM A bucket structure: 11 3DFP of a 2-layer 7-block floorplan

3D FLOORPLANNING ALGORITHM SA(Simulated Annealing): Cost = a*nwl+b*narea+c*nvc+d*C T Solution Perturbation: Rotation Swap Reverse Move Interlayer swap Z-neighbor swap Are based on the concept of z-axis neighbor Z-neighbor move Are based on the concept of z-axis neighbor 12

3D FLOORPLANNING ALGORITHM Z-axis neighbor: The definition is based on the bucket structure. The z-axis neighbor of a given block j. Zn(j):the block k in B(j) with the minimum neighboring cost zc(j,k)=a*|A k -A j |+b*dist(k,j) dist(k,j)=|x k -x j |+|y k -y j | Z-neighbor swap:is to swap a block with its z- axis neighbor. Z-neighbor move: B i is moved from its own layer l i to the layer l j where B j locates. B i is positioned adjacent to B j at either top or right side. 13

3D FLOORPLANNING ALGORITHM 14 After a z-neighbor swap operation on b and f After a z-neighbor move operation on d

3D FLOORPLANNING ALGORITHM Thermal model: Compact resistive thermal model[24] Simplified Closed-form thermal model Vertical Heat Flow Analysis Horizontal Heat Flow Analysis 15

3D FLOORPLANNING ALGORITHM 16 Vertical Heat Flow Analysis Considering only 1-D heat flow, minimize the Elmore delay like formula Horizontal Heat Flow Analysis Even out the temperature distribution on the chip, avoiding “hotspot”

E XPERIMENTAL RESULTS 17 With the new operations, 3D-FP can improve the area by 5% and wirelength by 3%

E XPERIMENTAL RESULTS 18 3D-FP-T can greatly reduce the temperature by 56% with 9.7x runtime

E XPERIMENTAL RESULTS 19 3D-FP-T-Fast can reduce the temperature by 40% with 1.8x runtime 3D-FP-T-Hybrid can reduce the temperature by 50% with 3.2x runtime

E XPERIMENTAL RESULTS 20 - by commercial FEM based tool (CFD-ACE+) - ami33 benchmark with 33 blocks and 4 layers