Revisiting and Bounding the Benefit From 3D Integration

Slides:



Advertisements
Similar presentations
OCV-Aware Top-Level Clock Tree Optimization
Advertisements

-1- VLSI CAD Laboratory, UC San Diego Post-Routing BEOL Layout Optimization for Improved Time- Dependent Dielectric Breakdown (TDDB) Reliability Tuck-Boon.
Timing Margin Recovery With Flexible Flip-Flop Timing Model
UC San Diego / VLSI CAD Laboratory NOLO: A No-Loop, Predictive Useful Skew Methodology for Improved Timing in IC Implementation Tuck-Boon Chan, Andrew.
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.
Intrinsic Shortest Path Length: A New, Accurate A Priori Wirelength Estimator Andrew B. KahngSherief Reda VLSI CAD Laboratory.
Boosting: Min-Cut Placement with Improved Signal Delay Andrew B. KahngSherief Reda CSE & ECE Departments University of CA, San Diego La Jolla, CA
Power-Aware Placement
Reticle Floorplanning With Guaranteed Yield for Multi-Project Wafers Andrew B. Kahng ECE and CSE Dept. University of California San Diego Sherief Reda.
On the Relevance of Wire Load Models Kenneth D. Boese, Cadence Design Systems, San Jose Andrew B. Kahng, UCSD CSE and ECE Depts., La Jolla Stefanus Mantik,
Architectural-Level Prediction of Interconnect Wirelength and Fanout Kwangok Jeong, Andrew B. Kahng and Kambiz Samadi UCSD VLSI CAD Laboratory
Supply Voltage Degradation Aware Analytical Placement Andrew B. Kahng, Bao Liu and Qinke Wang UCSD CSE Department {abk, bliu,
On Modeling and Sensitivity of Via Count in SOC Physical Implementation Kwangok Jeong Andrew B. Kahng.
1 A Tale of Two Nets: Studies in Wirelength Progression in Physical Design Andrew B. Kahng Sherief Reda CSE Department University of CA, San Diego.
On-Line Adjustable Buffering for Runtime Power Reduction Andrew B. Kahng Ψ Sherief Reda † Puneet Sharma Ψ Ψ University of California, San Diego † Brown.
1 UCSD VLSI CAD Laboratory ISQED-2009 Revisiting the Linear Programming Framework for Leakage Power vs. Performance Optimization Kwangok Jeong, Andrew.
ISPD 2000, San DiegoApr 10, Requirements for Models of Achievable Routing Andrew B. Kahng, UCLA Stefanus Mantik, UCLA Dirk Stroobandt, Ghent.
Layout-based Logic Decomposition for Timing Optimization Yun-Yin Lien* Youn-Long Lin Department of Computer Science, National Tsing Hua University, Hsin-Chu,
Topography-Aware OPC for Better DOF margin and CD control Puneet Gupta*, Andrew B. Kahng*†‡, Chul-Hong Park†, Kambiz Samadi†, and Xu Xu‡ * Blaze-DFM Inc.
Interconnect Implications of Growth-Based Structural Models for VLSI Circuits* Chung-Kuan Cheng, Andrew B. Kahng and Bao Liu UC San Diego CSE Dept.
7/13/ EE4271 VLSI Design VLSI Routing. 2 7/13/2015 Routing Problem Routing to reduce the area.
Enhanced Metamodeling Techniques for High-Dimensional IC Design Estimation Problems Andrew B. Kahng, Bill Lin and Siddhartha Nath VLSI CAD LABORATORY,
Andrew B. Kahng‡†, Mulong Luo†, Siddhartha Nath†
Hierarchical Physical Design Methodology for Multi-Million Gate Chips Session 11 Wei-Jin Dai.
Dose Map and Placement Co-Optimization for Timing Yield Enhancement and Leakage Power Reduction Kwangok Jeong, Andrew B. Kahng, Chul-Hong Park, Hailong.
MGR: Multi-Level Global Router Yue Xu and Chris Chu Department of Electrical and Computer Engineering Iowa State University ICCAD
-1- UC San Diego / VLSI CAD Laboratory A Global-Local Optimization Framework for Simultaneous Multi-Mode Multi-Corner Clock Skew Variation Reduction Kwangsoo.
A New Methodology for Reduced Cost of Resilience Andrew B. Kahng, Seokhyeong Kang and Jiajia Li UC San Diego VLSI CAD Laboratory.
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.
UC San Diego / VLSI CAD Laboratory Toward Quantifying the IC Design Value of Interconnect Technology Improvement Tuck-Boon Chan, Andrew B. Kahng, Jiajia.
Horizontal Benchmark Extension for Improved Assessment of Physical CAD Research Andrew B. Kahng, Hyein Lee and Jiajia Li UC San Diego VLSI CAD Laboratory.
A Polynomial Time Approximation Scheme For Timing Constrained Minimum Cost Layer Assignment Shiyan Hu*, Zhuo Li**, Charles J. Alpert** *Dept of Electrical.
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.
UC San Diego / VLSI CAD Laboratory Incremental Multiple-Scan Chain Ordering for ECO Flip-Flop Insertion Andrew B. Kahng, Ilgweon Kang and Siddhartha Nath.
An Efficient Clustering Algorithm For Low Power Clock Tree Synthesis Rupesh S. Shelar Enterprise Microprocessor Group Intel Corporation, Hillsboro, OR.
1 Wire Length Prediction-based Technology Mapping and Fanout Optimization Qinghua Liu Malgorzata Marek-Sadowska VLSI Design Automation Lab UC-Santa Barbara.
Improved Cut Sequences for Partitioning Based Placement Mehmet Can YILDIZ and Patrick H. Madden State University of New York at BinghamtonComputer Science.
-1- UC San Diego / VLSI CAD Laboratory Construction of Realistic Gate Sizing Benchmarks With Known Optimal Solutions Andrew B. Kahng, Seokhyeong Kang VLSI.
Massachusetts Institute of Technology 1 L14 – Physical Design Spring 2007 Ajay Joshi.
Kwangsoo Han, Andrew B. Kahng, Hyein Lee and Lutong Wang
Kwangsoo Han‡, Andrew B. Kahng‡† and Hyein Lee‡
ECO Timing Optimization Using Spare Cells Yen-Pin Chen, Jia-Wei Fang, and Yao-Wen Chang ICCAD2007, Pages ICCAD2007, Pages
Congestion Estimation and Localization in FPGAs: A Visual Tool for Interconnect Prediction David Yeager Darius Chiu Guy Lemieux The University of British.
ECE 260B – CSE 241A /UCB EECS Kahng/Keutzer/Newton Physical Design Flow Read Netlist Initial Placement Placement Improvement Cost Estimation Routing.
Mixed Cell-Height Implementation for Improved Design Quality in Advanced Nodes Sorin Dobre +, Andrew B. Kahng * and Jiajia Li * * UC San Diego VLSI CAD.
Outline Motivation and Contributions Related Works ILP Formulation
-1- UC San Diego / VLSI CAD Laboratory On Potential Design Impacts of Electromigration Awareness Andrew B. Kahng, Siddhartha Nath and Tajana S. Rosing.
1 WireMap FPGA Technology Mapping for Improved Routability Stephen Jang, Xilinx Inc. Billy Chan, Xilinx Inc. Kevin Chung, Xilinx Inc. Alan Mishchenko,
-1- UC San Diego / VLSI CAD Laboratory Optimization of Overdrive Signoff Tuck-Boon Chan, Andrew B. Kahng, Jiajia Li and Siddhartha Nath Tuck-Boon Chan,
-1- Delay Uncertainty and Signal Criticality Driven Routing Channel Optimization for Advanced DRAM Products Samyoung Bang #, Kwangsoo Han ‡, Andrew B.
Interconnect Characteristics of 2.5-D System Integration Scheme Yangdong (Steven) Deng & Wojciech P. Maly
EE4271 VLSI Design VLSI Channel Routing.
Prediction of Interconnect Net-Degree Distribution Based on Rent’s Rule Tao Wan and Malgorzata Chrzanowska- Jeske Department of Electrical and Computer.
Slide 1 SLIP 2004 Payman Zarkesh-Ha, Ken Doniger, William Loh, and Peter Bendix LSI Logic Corporation Interconnect Modeling Group February 14, 2004 Prediction.
Improved Flop Tray-Based Design Implementation for Power Reduction
Kun Young Chung*, Andrew B. Kahng+ and Jiajia Li+
Partial Reconfigurable Designs
The Interconnect Delay Bottleneck.
Chapter 7 – Specialized Routing
Wei-Ting J. Chan$, Yang Du+, Andrew B. Kahng$, Siddhartha Nath$
Jody Matos, Augusto Neutzling, Renato Ribas and Andre Reis
On the Relevance of Wire Load Models
Kristof Blutman† , Hamed Fatemi† , Andrew B
Improved Performance of 3DIC Implementations Through Inherent Awareness of Mix-and-Match Die Stacking Kwangsoo Han, Andrew B. Kahng and Jiajia Li University.
Andrew B. Kahng and Xu Xu UCSD CSE and ECE Depts.
Measuring Progress and Value of IC Implementation Technology
Capacitance variation 3/ (%)
Puneet Gupta1 , Andrew B. Kahng1 , Youngmin Kim2, Dennis Sylvester2
EE4271 VLSI Design, Fall 2016 VLSI Channel Routing.
Measuring the Gap between FPGAs and ASICs
Presentation transcript:

Revisiting and Bounding the Benefit From 3D Integration Wei-Ting J. Chan†, Andrew B. Kahng†‡ and Jiajia Li† †ECE and ‡CSE Departments, UC San Diego {wechan, abk, jil150}@ucsd.edu Thanks you for the introduction.

Outline Motivation Previous Work Implementation in Various Dimensions Netlist Structure vs. 3D Benefit Conclusions

Motivation 3DIC is a promising technology in “More-than- Moore” era 3DIC with > 2 tiers is expected to achieve more benefits [Song15]: Three-tier 3DIC achieve 15% more power reduction compared to two-tier 3DIC But: No upper bounds on power and area benefits from 3DIC have ever been established ! Goal: study upper bound of power and area reduction for 3DICs

Outline Previous Work Motivation Implementation in Various Dimensions Netlist Structure vs. 3D Benefit Conclusions

Previous Work (Power Benefit) Many previous works on 3DIC optimization More details are given in Table I of the paper Evaluations include both power and wirelength benefits

Previous Work (Wirelength Benefit) Many previous works on 3DIC optimization More details are given in Table I of the paper Evaluations include both power and wirelength benefits No previous work proposes upper bounds on 3DIC power and area reductions Chan et. al derive an upper bound of 67% on WL reduction

Implementation in Various Dimensions Outline Motivation Previous Work Implementation in Various Dimensions Netlist Structure vs. 3D Benefit Conclusions

Implementation in Various Dimensions Key idea: Infinite dimension gives us a bound on what 3 dimensions can deliver Infinite dimension: netlist optimization with zero wireload model 3D (w/ N tiers): placement and routing with shrunk LEF (by 1/ 𝑁 ) and annotated TSV RC Best 2D conventional implementation: vary key parameters  select best solution Parameters = synthesis frequency/utilization, placement utilization, BEOL options Pseudo-1D: placement and routing with large layout aspect ratio (e.g., 10:1)

Benefit Evaluation Flow: 3DIC (w/N Tiers) Cells and BEOL are scaled according to tier number T (X/Y to 𝑁 ) 2D P&R are spilt into M x M to apply FM-based partitioning RC of TSV are annotated according to tier number RC of cut nets = RC of 6 metals × N + TSV × (N-1) Cell and BEOL LEFs Scaled X/Y to 𝑁 2D P&R RC-annotation for TSVs Power Evaluation Incremental optimization Split floorplan into M x M grids FM-based min-cut partition for N tiers

Benefit Evaluation Flow: Conventional 2D Search within multiple design parameters to find optimum implementations Clock period (PnR) Synthesis frequency Tight (loose) timing: Slightly smaller (larger) synthesis clock period  Smaller power after P&R Placement utilization Unimodal model: Too compact  routing congestion Too sparse  longer wirelength

Benefit Evaluation Flow: Pseudo-1D Pseudo-1D implementations use floorplans with very large aspect ratios Routing along the long side is difficult PnR Aspect ratio = 10:1 to emulate 1D placement Limited routing channels along the long side

Infinite-Dimension Bound on 3D Power Benefits Iso-performance power comparison among implementations in different dimensions Gaps between infinite dimension vs. 2D  maximum 3D benefits = 36% and 20% for M0 and JPEG CORTEX M0 AES infD 20% 36% clock period (ns) clock period (ns)

Infinite-Dimension Bound on 3D Area Benefits Iso-performance area comparison among implementations in different dimensions 3D integration offers very small (< 10%) area benefits over 2D 3D integration may have converted area benefit into power benefit (e.g., buffer sizing or duplication) CORTEX M0 AES 3D (2 tier) 3D (3 tier) 10% 3D (4 tier) infD clock period (ns) clock period (ns)

Impact of Clock Skews on 3D Benefits Implementations with higher dimensions are more susceptible to clock skews Lower wire delays lead to less hold time margin P&R added more buffers to reduce the skew infD AES 11% 6% 1% Power (mW) 2D (0%) 5% -3% -21% CORTEXM0 Power (mW) 2D (0%) Clock uncertainty (% of clock period)

Netlist Structure vs. 3D Benefit Outline Motivation Previous Work Implementation in Various Dimensions Netlist Structure vs. 3D Benefit Conclusions

Netlist Structure vs. 3D Benefits Observation: 3D benefits vary across designs Goal: Find parameter(s) to indicate 3D benefits Studied parameters Timing slack distribution (Low correlation) Fanout / fanin distribution (Low correlation) Rent parameter (i.e., Rent exponent) (High correlation) Rent Parameter Empirical observation T = t∙gp T = #terminals t = constant g = #gates p = Rent exponent (indicator of netlist complexity) “Surface area to volume” power law: e.g., has p = 0.5

New Connection between Rent and 3D Benefit! More complex netlists demonstrate higher max 3D power benefit Benefits increase for higher-dimension implementations Iso-power post-synthesis netlists Rent (input / actual) Power (mW) Area (um2) 0.50 / 0.63 46.4 (100%) 39552 (100%) 0.55 / 0.66 46.8 (101%) 40262 (102%) 0.60 / 0.69 46.7 (101%) 40404 (102%) 0.65 / 0.71 47.4 (102%) 40532 (102%) 0.70 / 0.74 46.9 (101%) 40607 (103%) More complex netlists infD Lower complexity: Max benefit = 22% Higher complexity: Max benefit = 42% Power benefit to 2D

Rent and 3D Benefit: Real Designs Placement-based Rent exponent is well correlated with 3D benefits Rent parameter is possibly a simple indicator of 3D power benefits VGA JPEG LEON3MP CORTEX M0 AES Placement-based Rent parameter

Rent Parameter Modulation for 3D Attempt to synthesize same design into netlists of different Rent parameters Binning cells in 28FDSOI into four types {2-input, 3-input, 4-input, >4-input} Rent parameter modulation: scale area of cells by different ratios Example of Rent parameter modulation in commercial synthesis tool Rent 2-input 3-input 4-input >4-input 0.600 1 0.5 0.605 2 0.611 0.653 0.656 0.663

Ongoing: Dimension-Aware Implementation Observations: Rent parameter increases when more cells with high pin counts Observe correlated Rent parameter vs. % of >3-input cells Future work: Direct control in academic logic synthesizer Design: JPEG Placement-based Rent parameter

Ongoing: Dimension-Aware Implementation Shapes = set of implementations w/ different Rent; Colors = dimensions infD (≈ post-synthesis) power: x > +, 3D power: x ≈ +, 2D power: x < + Design: JPEG Implementation Rent O 0.600 X 0.605 0.611 0.653 0.656 0.663 infD Placement-based Rent parameter

Takeaways Synthesis optimization changes Rent parameter of netlists Design implementation (synthesis, P&R) should be aware of dimension Netlists with simple connections can be implemented in any dimension Netlists with complex connections are more suitable for 3D implementation (This is not surprising)

Outline Conclusions Motivation Previous Work Implementation in Various Dimensions Netlist Structure vs. 3D Benefit Conclusions

Conclusion and Future Goals Revisit 3D power and area benefit Implementation with infinite dimension upper-bounds 3D power and area benefits Correlation between placement-based Rent parameter and 3D benefits Ongoing/future work: Dimension-aware design implementation