Department of Computer Science and Engineering

Slides:



Advertisements
Similar presentations
Linear Time Algorithm to Find All Relocation Positions for EUV Defect Mitigation Yuelin Du, Hongbo Zhang, Qiang Ma and Martin D. F. Wong ASPDAC13.
Advertisements

THERMAL-AWARE BUS-DRIVEN FLOORPLANNING PO-HSUN WU & TSUNG-YI HO Department of Computer Science and Information Engineering, National Cheng Kung University.
New Graph Bipartizations for Double-Exposure, Bright Field Alternating Phase-Shift Mask Layout Andrew B. Kahng (UCSD) Shailesh Vaya (UCLA) Alex Zelikovsky.
A Graph-Partitioning-Based Approach for Multi-Layer Constrained Via Minimization Yih-Chih Chou and Youn-Long Lin Department of Computer Science, Tsing.
Minimizing Seed Set for Viral Marketing Cheng Long & Raymond Chi-Wing Wong Presented by: Cheng Long 20-August-2011.
Minimum Implant Area-Aware Gate Sizing and Placement
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.
Multi-Project Reticle Floorplanning and Wafer Dicing Andrew B. Kahng 1 Ion I. Mandoiu 2 Qinke Wang 1 Xu Xu 1 Alex Zelikovsky 3 (1) CSE Department, University.
Routability-Driven Blockage-Aware Macro Placement Yi-Fang Chen, Chau-Chin Huang, Chien-Hsiung Chiou, Yao-Wen Chang, Chang-Jen Wang.
Multi-Project Reticle Design & Wafer Dicing under Uncertain Demand Andrew B Kahng, UC San Diego Ion Mandoiu, University of Connecticut Xu Xu, UC San Diego.
WaferReticle Project Yield-Driven Multi-Project Reticle Design and Wafer Dicing Andrew B. Kahng 1, Ion Mandoiu 2, Xu Xu 1, and Alex Z. Zelikovsky 3 1.
Reticle Floorplanning With Guaranteed Yield for Multi-Project Wafers Andrew B. Kahng ECE and CSE Dept. University of California San Diego Sherief Reda.
Fixed-outline Floorplanning Through Better Local Search
Yield- and Cost-Driven Fracturing for Variable Shaped-Beam Mask Writing Andrew B. Kahng CSE and ECE Departments, UCSD Xu Xu CSE Department, UCSD Alex Zelikovsky.
UC San Diego Computer Engineering. VLSI CAD Laboratory.. UC San Diego Computer EngineeringVLSI CAD Laboratory.. UC San Diego Computer EngineeringVLSI CAD.
Design Bright-Field AAPSM Conflict Detection and Correction C. Chiang, Synopsys A. Kahng, UC San Diego S. Sinha, Synopsys X. Xu, UC San Diego A. Zelikovsky,
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.
A Cell-Based Row-Structure Layout Decomposer for Triple Patterning Lithography Hsi-An Chien, Szu-Yuan Han, Ye-Hong Chen, and Ting-Chi Wang Department of.
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.
Triple Patterning Aware Detailed Placement With Constrained Pattern Assignment Haitong Tian, Yuelin Du, Hongbo Zhang, Zigang Xiao, Martin D.F. Wong.
Metal Layer Planning for Silicon Interposers with Consideration of Routability and Manufacturing Cost W. Liu, T. Chien and T. Wang Department of CS, NTHU,
Cost-Based Tradeoff Analysis of Standard Cell Designs Peng Li Pranab K. Nag Wojciech Maly Electrical and Computer Engineering Carnegie Mellon University.
Routing 2 Outline –Maze Routing –Line Probe Routing –Channel Routing Goal –Understand maze routing –Understand line probe routing.
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.
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.
Hongbo Zhang, Yuelin Du, Martin D.F. Wong, Yunfei Deng, Pawitter Mangat Synopsys Inc., USA Dept. of ECE, Univ. of Illinois at Urbana-Champaign GlobalFoundries.
Planning Production of a Set of Semiconductor Components with Uncertain Wafer and Component Yield Frank W. Ciarallo Assistant Professor Biomedical, Industrial.
1 Modern Floorplanning Based on Fast Simulated Annealing Tung-Chieh Chen* and Yao-Wen Chang* # Graduate Institute of Electronics Engineering* Department.
Bus-Driven Floorplanning Hua Xiang*, Xiaoping Tang +, Martin D. F. Wong* * Univ. Of Illinois at Urbana-Champaign + Cadence Design Systems Inc.
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.
CSE 494: Electronic Design Automation Lecture 2 VLSI Design, Physical Design Automation, Design Styles.
Kwangsoo Han, Andrew B. Kahng, Hyein Lee and Lutong Wang
 Chemical-Mechanical Polishing (CMP)  Rotating pad polishes each layer on wafers to achieve planarized surfaces  Uneven features cause polishing pad.
Impact of Interconnect Architecture on VPSAs (Via-Programmed Structured ASICs) Usman Ahmed Guy Lemieux Steve Wilton System-on-Chip Lab University of British.
Pattern Sensitive Placement For Manufacturability Shiyan Hu, Jiang Hu Department of Electrical and Computer Engineering Texas A&M University College Station,
Pattern Sensitive Placement For Manufacturability Shiyan Hu, Jiang Hu Department of Electrical and Computer Engineering Texas A&M University College Station,
Dept. of Electrical and Computer Engineering The University of Texas at Austin E-Beam Lothography Stencil Planning and Optimization wit Overlapped Characters.
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.
A Stable Fixed-outline Floorplanning Method Song Chen and Takeshi Yoshimura Graduate School of IPS, Waseda University March, 2007.
An Efficient Linear Time Triple Patterning Solver Haitong Tian Hongbo Zhang Zigang Xiao Martin D.F. Wong ASP-DAC’15.
Non-stitch Triple Patterning- Aware Routing Based on Conflict Graph Pre-coloring Po-Ya Hsu Yao-Wen Chang.
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.
Layout Small-Angle Rotation and Shift for EUV Defect Mitigation
Multi-Split-Row Threshold Decoding Implementations for LDPC Codes
VLSI Floorplanning and Planar Graphs prepared and Instructed by Shmuel Wimer Eng. Faculty, Bar-Ilan University July 2015VLSI Floor Planning and Planar.
1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),
The Annealing Algorithm Revisited L.P.P.P. van Ginneken DigiPen Institute of Technology.
PACKAGE FABRICATION TECHNOLOGY Submitted By: Prashant singh.
The Early Days of Automatic Floorplan Design
Section 3.5 Linear Programing In Two Variables. Optimization Example Soup Cans (Packaging) Maximize: Volume Minimize: Material Sales Profit Cost When.
EE4271 VLSI Design VLSI Channel Routing.
DESIGN OF LATERAL MOSFET IN SILICON CARBIDE
11 Yibo Lin 1, Xiaoqing Xu 1, Bei Yu 2, Ross Baldick 1, David Z. Pan 1 1 ECE Department, University of Texas at Austin 2 CSE Department, Chinese University.
1 R-Trees Guttman. 2 Introduction Range queries in multiple dimensions: Computer Aided Design (CAD) Geo-data applications Support special data objects.
Introduction to ASICs ASIC - Application Specific Integrated Circuit
Partial Reconfigurable Designs
3-D IC Fabrication and Devices
Chart Packing Heuristic
An Improved Split-Row Threshold Decoding Algorithm for LDPC Codes
Sequence Pair Representation
Sheqin Dong, Song Chen, Xianlong Hong EDA Lab., Tsinghua Univ. Beijing
I. Floorplanning with Fixed Modules
EE4271 VLSI Design, Fall 2016 VLSI Channel Routing.
Survey on Coverage Problems in Wireless Sensor Networks
Communication Driven Remapping of Processing Element (PE) in Fault-tolerant NoC-based MPSoCs Chia-Ling Chen, Yen-Hao Chen and TingTing Hwang Department.
Presentation transcript:

Department of Computer Science and Engineering Design Space Exploration for Minimizing Multi-Project Wafer Production Cost Rung-Bin Lin (林榮彬) Department of Computer Science and Engineering Yuan Ze University

Outline Introduction IC fabrication cost Cost model for MPW Design space exploration for minimal cost MPW fabrication Experimental results Summary and future Work

What Is MPW? A Multiple Project Wafer (MPW) contains chips from different projects in the same reticle (mask). A reticle A wafer

SOURCE: SILICON LABS/TSMC Why MPW? Amortizing skyrocketing mask cost Photomask cost outlook (2004). Source: Rygler & Associates SOURCE: SILICON LABS/TSMC

Cost of IC Fabrication Mask cost Wafer cost Packaging cost Test cost Lithography versus non-lithography cost Packaging cost Test cost

Optical Layout – Beam Path The ASML PAS 5500/950B Step and Scan System Why Mask So Costly? Use of very expensive lithography tools (E-Beam) Throughput is low Optical Layout – Beam Path The ASML PAS 5500/950B Step and Scan System

Cost Trend of Lithography FutureFab International, issue 17

Elements of Mask Cost Rygler & Associates

The number of wafers used to meet production volumes Cost Model for MPW The number of wafers used to meet production volumes Total MPW cost Mask cost (Cm) A function of a reticle size Wafer cost Reticle size dependent wafer cost (Ce) Lithography (exposure) cost Reticle size independent wafer cost (Cw) Material cost Cost of process steps other than lithography Reticle area

Reticle Size Dependent Mask Cost 90nm node with 28 mask layers

Lithography Cost per Wafer A function of reticle size Smaller size  more exposures on a wafer A function of the number of mask layers Non-critical layer (12 layers) ($0.5 per exposure) Critical layer (8 layers) ($1.5 per exposure) Very critical layer (8 layers) ($2.5 per exposure)

How Much Paid by Per Project Logical reasoning A smaller chip should pay less than a larger chip if they have the same production volume. A chip with larger production volume should pay more than a chip with smaller production volume if they have the same area. $ paid by project p for MPW Production volume for project i Reticle area Area of project p

Cost Model Validation Cost shared by each chip with same volume. Cost shared by each chip with different volume. 8000 dice 5000 dice

Problem of Minimizing MPW Cost Given N chips with areas A1, A2, …, AN Required production volumes V1, V2, …, VN Decide The coordinates of the chips in a reticle Objective Minimize total MPW fabrication cost Constraints No chips overlap and all chips are inside the reticle Smaller than maximally allowable reticle size

Minimizing Total MPW Cost Minimizing mask cost Can be decided easily for a given reticle size Minimizing wafer cost Need dicing to know the total of number wafers used These two objectives are conflicting to some certain extent A balance between mask cost and wafer cost is needed

Key Decide the coordinates of the chips in a reticle A reticle

Reticle Floorplanning Problem (RFP) Given N chips with areas A1, A2, …, AN Required production volumes V1, V2, …, VN Decide The coordinates of the chips in a reticle Objective Minimize total number of wafers used Constraints No chips overlap and all chips are inside the reticle Smaller than maximally allowable reticle size

Why Reticle Floorplanning Difficult? Side-to-side dicing constraints

MPW Wafer Dicing Problem (WDP) Only way to know the number of wafers used Given a reticle floorplan of N chips and the required production volumes Decide Dicing lines on each wafer used Objective Achieve a minimal number of wafers used Constraint Side-to-side dicing constraint

Related Work for RFP Effective placement of chips on a shuttle mask. Proc. of SPIE, Vol. 5130, 2003, by S. Chen and E. C. Lynn. B* Tree for reticle area minimization Shuttle mask floorplanning. Proc. of SPIE. Vol. 5256, 2003, by G. Xu, R. Tian, D.F. Wong, A. J. Reich. Slicing tree for reticle area minimization (die-to-die inspec.) Chips on Wafer. Proc. of Workshop on Algorithms and Data Structures, 2003, by M. Andersson, J. Gudmundsson, and C. Levcopoulos. Grid floorplan for maximizing compatibility A multi-objective floorplanner for shuttle mask. Proc. of SPIE. Vol. 5567, 2004, by G. Xu, R. Tian, D. Z. Pan, and D. F. Wong. Die-to-die inspection, area, wafer utilization, metal density (SA)

Related Work for RFP Cont. Multi-project reticle floorplanning and wafer dicing. Proc. of ISPD, 2004 by A. B. Kahng, I. Mandoiu, Q. Wang, X. Xu, and A. Z. Zelikovsky. Packing chips in shelves using SA for reticles on square wafers. Reticle floorplanning with guaranteed yield for multi-project wafers. Proc. of ICCD, 2004 by A. B. Kahng and S. Reda. Grid floorplan using branch-and-bound on square wafers Shelf packing+shifting SA

Related Work for RFP Cont. CMP aware shuttle mask floorplanning. ASPDAC, 2005 by G. Xu, R. Tian, D. Z. Pan, and D. F. Wong. Reticle floorplanning and wafer dicing for multiple project wafers. ISQED, 2005, by M. C. Wu and R. B. Lin . First compatibility- and volume-driven floorplanner Reticle Floorplanning of Flexible Chips for Multi-project Wafers. GLSVLSI, 2005 by M. C. Wu and R.B. Lin

Related Work for WDP A multi-objective floorplanner for shuttle mask. Proc. of SPIE. Vol. 5567, 2004, by G. Xu, R. Tian, D. Z. Pan, and D. F. Wong. Coloring Dicing: Finding a minimum number of color sets from a reticle conflict graph A color set defines a reticle dicing plan.

Related Work for WDP Cont. Multi-project reticle floorplanning and wafer dicing. Proc. of ISPD, 2004 by A. B. Kahng, I. Mandoiu, Q. Wang, X. Xu, and A. Z. Zelikovsky 1 Non-linear programming model, 3 ILP models, 1 heuristic (IASA) Work for square wafers Based on finding the intersection between a vertical and a horizontal maximum independent sets Vertical conflict graph Horizontal conflict graph

Related Work for WDP Cont. A Comparative study on dicing of multiple project wafers. IEEE CSAS on VLSI, 2005 by M. C. Wu and R. B. Lin Several dicing ILP models based on coloring reticle conflict graph One SA implementation based on horizontal and vertical maximum independent sets

Good bare dice with a 200mm wafer Min Reticle Area?   ANS: NO (a) width=12, height=6 (b) width=12, height=8 required volume case 100, 100, 100 150 100, 150, (a) 392 NS (b) 476 426 Good bare dice with a 200mm wafer This figure shows two floorplans for a 3-chip instance. The numbers of good bare dice for these two floorplans with a 200 mm wafer are given in the table. They are obtained by an approach (D2 model) described later. Clearly, the reticle floorplan in (b) is better than the one in (a) that has a minimum area. Some other cases not shown in here are also much worse than (b).  

Design Space Exploration Use an efficient method to obtain as many good floorplans as possible Perform wafer dicing to obtain the number of wafers required Plug in our cost model to compute total MPW cost for a given reticle floorplan mask cost plus wafer cost Choose the floorplan with least cost as the solution

Compatibility and Area Driven Floorplanner Simulated Annealing implementation Move a chip to a new location. Rotate a chip. Move a chip and then rotate it. Move a chip and align it with another chip. Objective function Volume-driven compatibility Chip overlap penalty Reticle area

Experimental Setup 300 mm wafer Reticle-size independent wafer cost $2500 per wafer Mask cost 8 very critical ($2.5), 8 critical ($1.5), 12 non-critical ($0.5) layers

(w, h | 1X required volume) Wmax=20 mm, Hmax=20 mm Test Cases (w, h | 1X required volume) Wmax=20 mm, Hmax=20 mm I5 (2.5,6.25 | 100|), (1.8,5.5 | 200), (2,1.25 | 300), (2.2,1.75 | 200), (1.7,2.25 | 200), (1.5,1.55 | 200), (2.3,3.75 | 200), (1,3.25 | 200), (1.3,4.25 | 80), (2.7, 1.1 | 60) I6 (6.5, 6.5 | 60), (4.5, 5.0 | 100), (5.5, 1.5 | 120), (4.5, 3.0 | 120), (6.5, 3.5 | 160), (4.5, 3.5 | 160), (6.5, 8.0 | 200), (3.3, 3.5 | 200), (2.5, 3.5 | 200), (3.5, 2.5 | 200), (7.5, 2.5 | 200), (4.0, 2.5 | 200), (2.5, 2.5 | 200)

MPW Cost for I5 with 1X Volume.

MPW Cost for I5 with 50X Volume

MPW Cost for I6 with 1X Volume

MPW Cost for I6 with 50X Volume

Summary Saving in production cost with a good floorplan Small volume production (1X) 47% for I5 30% for I6 Medium volume production 41% for I5 42% for I6

Yield and Cost for I5 (1X Volume) Dicing yield: Min Bp/Vp for all chips p, where Bp is the number of good dice

Area and Cost for I5 (1X Volume)

Yield and Cost for I5 (50X Volume)

Area and Cost for I5 (50X Volume)

Yield and Cost for I6 (1X Volume)

Area and Cost for I6 (1X Volume)

Yield and Cost for I6 (50X Volume)

Area and Cost for I6 (50X Volume)

Summary For low-volume production For higher volume production Small reticle size usually means lower MPW fabrication cost For higher volume production Neither reticle area nor dicing yield can solely decides the cost of MPW fabrication A design space exploration is usually required to achieve minimal fabrication cost

Taiwan: An Island of Continental Dimensions On Going Work Floorplanning chips on multiple reticles Taiwan: An Island of Continental Dimensions George Burns, Strategic Marketing Associates, Santa Cruz, Calif. -- 9/1/2003 Semiconductor International

Acknowledgements THANK YOU The research work presented in this talk is mainly done my student Meng-Chiou Wu. THANK YOU