© 2014 – James R. Morrison – IEEE CASE – August 2014 - 1 CASE 2014 Technical Presentation Cycle Time and Throughput Models of Clustered Photolithography.

Slides:



Advertisements
Similar presentations
©2012 – Kyungsu Park – IEEE CASE – Seoul – August 22, 2012 – 1 Performance Bounds for Hybrid Flow Lines: Fundamental Behavior, Practical Features and Application.
Advertisements

EE 201A Modeling and Optimization for VLSI LayoutJeff Wong and Dan Vasquez EE 201A Noise Modeling Jeff Wong and Dan Vasquez Electrical Engineering Department.
Achieving Elasticity for Cloud MapReduce Jobs Khaled Salah IEEE CloudNet 2013 – San Francisco November 13, 2013.
Random Number Generation. Random Number Generators Without random numbers, we cannot do Stochastic Simulation Most computer languages have a subroutine,
CASE 2010 Analysis of Circular Cluster Tools: Transient Behavior and Semiconductor Equipment Models Analysis of Circular Cluster Tools: Transient Behavior.
Queueing Models and Ergodicity. 2 Purpose Simulation is often used in the analysis of queueing models. A simple but typical queueing model: Queueing models.
©2013 – James R. Morrison – UIUC ISE Seminar – August 22, 2013 Recent Directions in the Theory of Flow Lines with Applications to Semiconductor Manufacturing.
©2014 –James R. Morrison – ISMI Keynote II – August 17, 2014 – 1 Models for the Performance of Clustered Photolithography Tools with Applications James.
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 19 Scheduling IV.
1/ Setup time and batch size reduction Factory Automation Laboratory Seoul National University July 23, 1999 Byun, MyungHee.
Oliver Rose Dresden University of Technology Department of Computer Science Chair for Modeling and Simulation Benefits and Drawbacks of Simple Models for.
Nur Aini Masruroh Queuing Theory. Outlines IntroductionBirth-death processSingle server modelMulti server model.
ECS 152A Acknowledgement: slides from S. Kalyanaraman & B.Sikdar
Discrete-Event Simulation: A First Course Steve Park and Larry Leemis College of William and Mary.
Engineering Data Analysis & Modeling Practical Solutions to Practical Problems Dr. James McNames Biomedical Signal Processing Laboratory Electrical & Computer.
MODELING AND ANALYSIS OF MANUFACTURING SYSTEMS Session 6 SCHEDULING E
OS Fall ’ 02 Performance Evaluation Operating Systems Fall 2002.
Managing Process Flows
Little’s Theorem Examples Courtesy of: Dr. Abdul Waheed (previous instructor at COE)
An overview of design and operational issues of kanban systems M. S. AKTÜRK and F. ERHUN Presented by: Y. Levent KOÇAĞA.
© January 27, 2006 Dr. Lynn Fuller, Motorola Professor Simulation Page 1 Rochester Institute of Technology Microelectronic Engineering ROCHESTER INSTITUTE.
Carnegie Mellon Adaptive Mapping of Linear DSP Algorithms to Fixed-Point Arithmetic Lawrence J. Chang Inpyo Hong Yevgen Voronenko Markus Püschel Department.
1 Achieving 100% throughput Where we are in the course… 1. Switch model 2. Uniform traffic  Technique: Uniform schedule (easy) 3. Non-uniform traffic,
OS Fall ’ 02 Performance Evaluation Operating Systems Fall 2002.
CHAPTER 19 Scheduling Operations Management, Eighth Edition, by William J. Stevenson Copyright © 2005 by The McGraw-Hill Companies, Inc. All rights reserved.
WINTER 2012IE 368. FACILITY DESIGN AND OPERATIONS MANAGEMENT 1 IE 368: FACILITY DESIGN AND OPERATIONS MANAGEMENT Lecture Notes #3 Production System Design.
Dimitrios Konstantas, Evangelos Grigoroudis, Vassilis S. Kouikoglou and Stratos Ioannidis Department of Production Engineering and Management Technical.
Queuing Networks. Input source Queue Service mechanism arriving customers exiting customers Structure of Single Queuing Systems Note: 1.Customers need.
Spreadsheet Modeling & Decision Analysis
Department of Industrial and Systems Engineering
Scheduling.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 16 Scheduling.
Introduction to Discrete Event Simulation Customer population Service system Served customers Waiting line Priority rule Service facilities Figure C.1.
The Simulation Project. Simulation Project Steps a.- Problem Definition b.- Statement of Objectives c.- Model Formulation and Planning d.- Model Development.
IE 101 Facilities Location and Design By Assist.Prof.Dr. Nureddin KIRKAVAK Department of Industrial Engineering.
Jungyeon Park – xS3D Lab Seminar – September xS3D Lab Seminar Cycle Time and Throughput Models of Clustered Photolithography Tools for Fab-Level.
Planning Production of a Set of Semiconductor Components with Uncertain Wafer and Component Yield Frank W. Ciarallo Assistant Professor Biomedical, Industrial.
©2009 – James R. Morrison – IEEE CASE 2009 – August 25, 2009 Regular Flow Line Models for Semiconductor Cluster Tools: James R. Morrison Assistant Professor.
1 Chapter 5 Flow Lines Types Issues in Design and Operation Models of Asynchronous Lines –Infinite or Finite Buffers Models of Synchronous (Indexing) Lines.
©2010 – IEEE CASE 2010 – Toronto – August 22, 2010 Analysis of Circular Cluster Tools: Transient Behavior and Semiconductor Equipment Models Younghun Ahn.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 16 Scheduling.
Lecture 14 – Queuing Networks Topics Description of Jackson networks Equations for computing internal arrival rates Examples: computation center, job shop.
Chapter 3 System Performance and Models. 2 Systems and Models The concept of modeling in the study of the dynamic behavior of simple system is be able.
Queuing Theory Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Chapter.
Performance Prediction for Random Write Reductions: A Case Study in Modelling Shared Memory Programs Ruoming Jin Gagan Agrawal Department of Computer and.
1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.
Sept. 27, 2002RCL - Fab starts scheduling 1 Scheduling Dedicated Lithography Equipment Dr. Robert C. Leachman Dept. of Indus Eng & Oper Res U C Berkeley.
Network Design and Analysis-----Wang Wenjie Queuing Theory III: 1 © Graduate University, Chinese academy of Sciences. Network Design and Performance Analysis.
IEEE ICCA 2010 – Xiamen, June 11, 2010 On Closed Form Solutions for Equilibrium Probabilities in the Closed Lu-Kumar Network under Various Buffer Priority.
4th Annual INFORMS Revenue Management and Pricing Section Conference, June 2004 An Asymptotically-Optimal Dynamic Admission Policy for a Revenue Management.
1 Part 2 & 3 Performance evaluation. 2 Goals Understand the complex behavior of systems subject to "random phenomena" Develop intuitive understanding.
CSCI1600: Embedded and Real Time Software Lecture 19: Queuing Theory Steven Reiss, Fall 2015.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
XS3D Lab Seminar, September 10, 2014, Sang Yoon Bae – 1 xS3D Summer Research Focus Period Lab Seminar Presentation: Sang Yoon Bae Department of Industrial.
Chapter 1: The Queueing Paradigm The behavior of complex electronic system  Statistical prediction Paradigms are fundamental models that abstract out.
(C) J. M. Garrido1 Objects in a Simulation Model There are several objects in a simulation model The activate objects are instances of the classes that.
1 Queuing Delay and Queuing Analysis. RECALL: Delays in Packet Switched (e.g. IP) Networks End-to-end delay (simplified) = End-to-end delay (simplified)
Lot-Sizing and Lead Time Performance in a Manufacturing Cell Article from Interfaces (1987) by U. Karmarkar, S. Kekre, S. Kekre, and S. Freeman Illustrates.
Indian Institute of Technology Bombay 1 Communication Networks Prof. D. Manjunath
1 Decision Making ADMI 6510 Simulation Key Sources: Data Analysis and Decision Making (Albrigth, Winston and Zappe) An Introduction to Management Science:
OPERATING SYSTEMS CS 3502 Fall 2017
Lecture 14 – Queuing Networks
Chapter 7 Network Flow Slides by Kevin Wayne. Copyright © 2005 Pearson-Addison Wesley. All rights reserved.
Professor Arne Thesen, University of Wisconsin-Madison
CSCI1600: Embedded and Real Time Software
Predictive Performance
ITRS 2003 Factory Integration Chapter Backup Material
Chap 11 Learning Objectives
Variability 8/24/04 Paul A. Jensen
Lecture 14 – Queuing Networks
Presentation transcript:

© 2014 – James R. Morrison – IEEE CASE – August CASE 2014 Technical Presentation Cycle Time and Throughput Models of Clustered Photolithography Tools for Fab-Level Simulation Kyungsu Park and James. R. Morrison Department of Industrial and Systems Engineering KAIST, South Korea

© 2014 – James R. Morrison – IEEE CASE – August Presentation Overview Motivation System description: Clustered photolithography tool (CPT) Equipment models  Linear model  Affine model  Exit recursion model  Flow line model Numerical experiments  Same sample & same parameter  Different sample & same parameter  Different sample & different parameter Concluding remarks

© 2014 – James R. Morrison – IEEE CASE – August Motivation

© 2014 – James R. Morrison – IEEE CASE – August Motivation (1) Semiconductor manufacturing Global revenue in 2013: NT$ 9,540 billion (US$ 318 billion) Construction costs 300 mm wafer fab: NT$150 billion (US$ 5 billion [2]) 450 mm wafer fab:NT$ billion (US$10-15 billion) Significant value for improvements : Fab production control method earned Samsung NT$ 15 bi llion (US$ 1 billion [3]) additional revenue 2005: IBM’s 30 independent supply chains merged into a single global system and saved NT$ 180 billion (US$ 6 billion [4]) … [1]

© 2014 – James R. Morrison – IEEE CASE – August Motivation (2) Clustered photolithography tools (CPT) Purchase cost of NT$ billion (US$ M [5]) The most expensive tool in a fabricator Typically the bottleneck of the fabricator Key yield and cycle time contributor [5]

© 2014 – James R. Morrison – IEEE CASE – August Motivation (3) Want: Models for CPTs Accurate:Predict throughput with less than 1% error Expressive:Incorporate fundamental behaviors Computationally tractable:Very quick to calculate results For the purpose of: Understanding toolset performance Enabling capacity optimization Toolset scheduling or optimization Improving the quality of fab simulation models

© 2014 – James R. Morrison – IEEE CASE – August System Description: Clustered Photolithography Tool (CPT)

© 2014 – James R. Morrison – IEEE CASE – August System Description: CPT (1) Multi-cluster tool, robot in each cluster, IF buffers, STK buffer Scanner is often the CPT bottleneck Largely deterministic process times Process time can vary by product Setups between lots (reticle changes, pre-scan setup, …) Wafer handling robot decision policy & deadlock prevention [6] C lustered P hotolithography T ool Scanner

© 2014 – James R. Morrison – IEEE CASE – August System Description: CPT (2) “

© 2014 – James R. Morrison – IEEE CASE – August System Description: Performance Metrics Notation a l : Arrival time of lot l to the tool S l : Start time of lot l in the tool C l : Completion time of lot l from the tool Performance measures Cycle time of lot l : CT l := C l - a l Lot residency time of lot l : LRT l := C l - S l Throughput time of lot l : TT l := min{ LRT l, C l – C l -1 } Lot 1 Lot 2 Lot 3 Time TT 2 TT 3 TT 1 Computation time

© 2014 – James R. Morrison – IEEE CASE – August Equipment Models

© 2014 – James R. Morrison – IEEE CASE – August Models for CPTs Models with various levels of detail Affine Models Exit Recursion Models Flow Line Models A(k1), B A(k1), B(k1, k2) A(k1), B(k1) With complete tool log data With wafer in/out log data With lot in/out log data Parametric flow lines Empirical flow lines Linear Model A(k1) Access Big Data Data Analytics Simulate models Detailed Model “Everything”

© 2014 – James R. Morrison – IEEE CASE – August Linear Model Pros: – Simple to understand – Fast computation Cons: – Exactly matched to single wafer tool, not to CPT m AlAl Ax Model for lot cycle time in a one machine tool Wafers enter Wafers exit

© 2014 – James R. Morrison – IEEE CASE – August Affine Models Referred to as the Ax+B model First wafer delay: B l Time between wafer completions: A l Process time estimation: T l PT = A k1 ∙ (w( l ) – 1) + B l ( w( l ) : the number of wafers of lot l ) B can be generalized to B(k1), B(k1, k2) Pros: Simple to understand Fast computation Cons: Only one module per process, so not matched to CPT New lots enter only when the tool is empty

© 2014 – James R. Morrison – IEEE CASE – August Flow Line Models: Elementary Evolution Equations Process i W-1W

© 2014 – James R. Morrison – IEEE CASE – August Flow Line Models: Extensions Elementary Evolution Equations (EEEs) can be generalized to allow: Different classes of wafer to be produced Multiple modules per process Consider robotic workload in process times of modules Consider setups – reticle setup, pre-scan setup Parameter extraction Parametric flow line model – Known process times, robot times, and setup times Empirical flow line model – Parameters extracted from tool processing data Wafers enter Wafers exit

© 2014 – James R. Morrison – IEEE CASE – August Flow Line Models: Exit Recursions Theorem: Exact recursion for customer completion (exit) times [7,8] Theorem: Recursive bound for customer completion (exit) times [9] P1P1 11 …… Wafer Lots Arrive P2P2 22 PMPM MM Wafer Lots Exit … P3P3 33 …… Customers Arrive Customers Exit … R 1 =2 P2P2 R 2 =1 R 3 =3 R M =2

© 2014 – James R. Morrison – IEEE CASE – August Exit Recursion Model (1) Conceptually based on flow line exit recursions Complete model No Contention at bottleneckContention at bottleneck

© 2014 – James R. Morrison – IEEE CASE – August Exit Recursion Model (2) Parameter extraction Populations used as a function of available category of data

© 2014 – James R. Morrison – IEEE CASE – August Model Properties Completion times in the exit recursion model exactly match those in a deterministic flow line from which the parameters are derived with (i)A single class of wafers and constant setup between wafers, or (ii)Multiple wafer classes with no setup, proportional service and geometric decay within channels Proposition: Exactness on completion times in the exit recursion model (i)All completion times in the linear model exactly match those in a single process deterministic flow line from which the parameters are derived.. (ii)Throughput time can be exactly achieved on average in a flow line with different structure.. Proposition: Exactness of completion times in the linear model (i)Completion times in the affine model exactly match those in a deterministic flow line in which each lot starts on an empty tool (via full flush constraint) from which the parameters are derived. (ii)Throughput time can be exactly achieved on average in a flow line with different structure.. Proposition: Exactness of completion times in the affine model

© 2014 – James R. Morrison – IEEE CASE – August Numerical Experiments

© 2014 – James R. Morrison – IEEE CASE – August Numerical Experiments LWP(Longest waiting pair) robot policy [6] : gives optimal steady state throughput Dead lock avoidance rule Setup time ~ Uniform(210, 260); Reticle alignment ~ Uniform(240, 420) 13,000 lots x 30 replications Assume detail simulation is true operation. A : Linear Model B : Affine Model - A(k1),B C : Affine Model - A(k1),B(k1) D : Affine Model - A(k1),B(k1,k2) E : FL Model F : EFL Model G : ER Model - Tool Log H : ER Model - Wafer Log I : ER Model - Lot Log [1]

© 2014 – James R. Morrison – IEEE CASE – August Same Sample, Same Parameter loading level : 0.95, train level : 3, lot size : {22, 23, 24} with probability {0.25, 0.5, 0.25}, both setups 36.36%36.35%36.28%36.26% -0.09%-0.13% 2.60%3.52%3.17% %-51.33% 2.74%0.61%-2.59%2.56%2.34% 0.00% %-0.02%0.00%0.03%-0.09% % Linear model & Affine models are only good in throughput time. ER models & Flow line models are good in all times.

© 2014 – James R. Morrison – IEEE CASE – August Same Sample, Same Parameter loading level : 0.3, train level : 3, lot size : {22, 23, 24} with probability {0.25, 0.5, 0.25}, both setups 2.16%2.15% -0.30%-0.57% 2.27% 2.33% -0.04% %0.20%-0.09%0.81% 3.97% 1.71% -0.00% -0.13%-0.35%0.03%0.07%-1.82% % Linear model & Affine models are good in cycle time, and throughput time. ER models & Flow line models are good in all times

© 2014 – James R. Morrison – IEEE CASE – August Different Sample, Same Parameter loading level : 0.95, train level : 3, lot size : {22, 23, 24} with probability {0.25, 0.5, 0.25}, both setups 58.35% 43.43%46.19%47.40% 4.97%-0.37%1.24%2.70%2.04% %-51.31% 2.75%0.62%-2.58%2.77%2.46% -0.12%0.05% 0.06%0.03%0.01% 0.04%-0.00% % Linear model & Affine models are only good in throughput time. ER models & Flow line models are good in all times.

© 2014 – James R. Morrison – IEEE CASE – August Different Sample, Same Parameter loading level : 0.3, train level : 3, lot size : {22, 23, 24} with probability {0.25, 0.5, 0.25}, both setups 2.57%2.65%2.52%2.42% -0.17%-0.35% 2.30%2.28% 0.44% % 0.29%-0.03%0.84% 3.98% 2.23% 0.09%0.19%0.17% -0.16%-0.37%0.05%0.14%-1.46% %-17.16% Linear model & Affine models are good in cycle time, and throughput time. ER models & Flow line models are good in all times

© 2014 – James R. Morrison – IEEE CASE – August Different Sample, Different Parameter From loading level : 0.95 & train level : 3, To lading level : 0.8 & train level : 1 With lot size : {22, 23, 24} with probability {0.25, 0.5, 0.25}, both setups -5.09%-4.05% -5.90% -4.12%-0.04% 0.43% 19.29% 20.21% 17.67% % 0.11%0.08%2.17%6.36%5.67% -5.19%-5.09% -4.97%-0.00%-0.11%0.00%-0.04% -0.42% % % Linear model & Affine models are slightly good in cycle time, and throughput time. ER models are good in lot residency time, and throughput time. Only FL models are good in all times.

© 2014 – James R. Morrison – IEEE CASE – August Different Sample, Different Parameter From lot size: {22, 23, 24} with {0.25, 0.5, 0.25}, to lot size: {12, 13, 14} with {0.25, 0.5, 0.25} with loading level : 0.95, train level : 3, both setups %-14.54%-15.85%-15.21%0.29%-0.64% 17.66%16.71% -0.43% %-56.67%-56.68%-56.67%1.26%0.39% 3.56%7.43% 0.38% % -9.92% -0.13%-0.16% -0.17% 0.02% -3.78% Linear model & Affine models are bad in all times. ER models are good in lot residency time, and throughput time. Only FL models are good in all times.

© 2014 – James R. Morrison – IEEE CASE – August Computational Comparison Relative Computation Time Linear Model0.5 Affine Model1 ER Model2.4 FL Model120 Detailed Simulation13,000

© 2014 – James R. Morrison – IEEE CASE – August Accuracy Comparison Errors relative to detailed model Error of 20%+ Error 5-20% Error 0-5% Same Sample, Same ParameterDifferent Sample, Same ParameterDifferent Sample, Different Parameter Linear ModelCTLRTTTCTLRTTTCTLRTTT Affine ModelsCTLRTTTCTLRTTTCTLRTTT ER ModelsCTLRTTTCTLRTTTCTLRTTT Flow Line ModelsCTLRTTTCTLRTTTCTLRTTT

© 2014 – James R. Morrison – IEEE CASE – August Concluding Remarks

© 2014 – James R. Morrison – IEEE CASE – August Concluding Remarks CPT: Expensive & typically fab bottleneck toolset Models for CPT throughput time, process time & cycle time Classic models: Linear, affine Recent models: Flow line, exit recursion Compare: Computation and accuracy Next directions Improved models: Newer exit recursions, additional parameters Implementation: Fab simulation, optimization, etc.

© 2014 – James R. Morrison – IEEE CASE – August References 1.HIS iSuppli April Elpida Memory, Inc., available at 3.Leachman, Robert C., Jeenyoung Kang, and Vincent Lin. "SLIM: Short cycle time and low inventory in manuf acturing at samsung electronics." Interfaces32.1 (2002): Roger H. French and V. Hoang, “Immersion Lithography: Photomask and Wafer-Level Materials,” Tran. Annual Review of Materials Research, Vol. 39, Hyun Joong Yoon and Doo Yong Lee, “Deadlock-free scheduling of photolithography equipment in semicon ductor fabrication,” IEEE Trans. Semi. Mfg., vol. 17, no. 1, pp , Avi-Itzhak, B. "A sequence of service stations with arbitrary input and regular service times." Management Science 11.5 (1965): Friedman, Henry D. "Reduction methods for tandem queuing systems." Operations Research 13.1 (1965): Park, Kyungsu, and James R. Morrison. "Performance evaluation of deterministic flow lines: Redundant mo dules and application to semiconductor manufacturing equipment." Automation Science and Engineering ( CASE), 2010 IEEE Conference on. IEEE, Morrison, James R. "Deterministic flow lines with applications." Automation Science and Engineering, IEEE Transactions on 7.2 (2010): Morrison, James R. "Multiclass flow line models of semiconductor manufacturing equipment for fab-level s imulation." Automation Science and Engineering, IEEE Transactions on 8.1 (2011): Longest waiting pair: [7] Geismar, H.N.; Sriskandarajah, C.; Ramanan, N., "Increasing throughput for robotic cells with parallel Machines and multiple robots," IEEE Trans. Auto. Sci. and Eng., vol.1, no.1, pp.84,89, Jul 2004