Yan Qiao and Naiqi Wu Guangdong University of Technology, Guangdong University of Technology, China China Mengchu Zhou New Jersey Institute of Technology,

Slides:



Advertisements
Similar presentations
I/O Management and Disk Scheduling
Advertisements

1 SE-561 Formal Methods in Software Petri Nets - I.
Introduction to Petri Nets Hugo Andrés López
Petri Nets Section 2 Roohollah Abdipur.
Yazid Mati & Xiaolan Xie CRF Club, 04/07/2004 Scheduling Automated Manufacturing Systems with Transportation and Storage Constraints Yazid MATI Ecole des.
Kick-off Meeting, July 28, 2008 ONR MURI: NexGeNetSci Distributed Coordination, Consensus, and Coverage in Networked Dynamic Systems Ali Jadbabaie Electrical.
Implementation Approaches with FPGAs Compile-time reconfiguration (CTR) CTR is a static implementation strategy where each application consists of one.
A tool to generate optimal schedules for complex real-time systems : Petri Net Scheduling, Modeling and Analysis of Real-Time Systems LISI-ENSMA Laboratoire.
Solutions for Scheduling Assays. Why do we use laboratory automation? Improve quality control (QC) Free resources Reduce sa fety risks Automatic data.
1 BalsaOpt a tool for Balsa Synthesis Francisco Fernández-Nogueira, UPC (Spain) Josep Carmona, UPC (Spain)
CASE 2010 Analysis of Circular Cluster Tools: Transient Behavior and Semiconductor Equipment Models Analysis of Circular Cluster Tools: Transient Behavior.
1 Modeling based on Petri-nets. Lecture 8. 2 High-level Petri nets The classical Petri net was invented by Carl Adam Petri in A lot of research.
IE 469 Manufacturing Systems
CS 795 – Spring  “Software Systems are increasingly Situated in dynamic, mission critical settings ◦ Operational profile is dynamic, and depends.
Oliver Rose Dresden University of Technology Department of Computer Science Chair for Modeling and Simulation Benefits and Drawbacks of Simple Models for.
1 HW/SW Partitioning Embedded Systems Design. 2 Hardware/Software Codesign “Exploration of the system design space formed by combinations of hardware.
Modeling Worldviews Activity Scanning – Petri Nets and Event Graphs Event Scheduling – Event Graphs State Machines Process Interaction –Block Flow Diagrams.
Models of Computation for Embedded System Design Alvise Bonivento.
Device Management.
Processing Rate Optimization by Sequential System Floorplanning Jia Wang 1, Ping-Chih Wu 2, and Hai Zhou 1 1 Electrical Engineering & Computer Science.
Lecturer: Dr. AJ Bieszczad Chapter 22-1 Process includes: all major process activities resources used, subject to set of constraints (such as schedule)
Thermal-Aware SoC Test Scheduling with Test Set Partitioning and Interleaving Zhiyuan He 1, Zebo Peng 1, Petru Eles 1 Paul Rosinger 2, Bashir M. Al-Hashimi.
Deadlock-Free and Collision-Free Coordination of Two Robot Manipulators Presented by Huy Nguyen April 28, 2003.
Mata kuliah :K0362/ Matematika Diskrit Tahun :2008
Petri Nets An Overview IE 680 Presentation April 30, 2007 Renata Kopach- Konrad.
Scheduling for Dedicated Machine Constraint Using Integer Programming Huy Nguyen Anh Pham, Arthur Shr, and Peter P. Chen Louisiana State University, Baton.
The Simulation Project. Simulation Project Steps a.- Problem Definition b.- Statement of Objectives c.- Model Formulation and Planning d.- Model Development.
1 A Petri Net Siphon Based Solution to Protocol-level Service Composition Mismatches Pengcheng Xiong 1, Mengchu Zhou 2 and Calton Pu 1 1 College of Computing,
Jorge Muñoz-Gama Universitat Politècnica de Catalunya (Barcelona, Spain) Algorithms for Process Conformance and Process Refinement.
©2009 – James R. Morrison – IEEE CASE 2009 – August 25, 2009 Regular Flow Line Models for Semiconductor Cluster Tools: James R. Morrison Assistant Professor.
A Framework for Distributed Model Predictive Control
1 TEMPLATE MATCHING  The Goal: Given a set of reference patterns known as TEMPLATES, find to which one an unknown pattern matches best. That is, each.
T. E. Potok - University of Tennessee Software Engineering Dr. Thomas E. Potok Adjunct Professor UT Research Staff Member ORNL.
Switch-and-Navigate: Controlling Data Ferry Mobility for Delay-Bounded Messages Liang Ma*, Ting He +, Ananthram Swami §, Kang-won Lee + and Kin K. Leung*
Modeling with ordinary Petri Nets Events: Actions that take place in the system The occurrence of these events is controlled by the state of the system.
©2010 – IEEE CASE 2010 – Toronto – August 22, 2010 Analysis of Circular Cluster Tools: Transient Behavior and Semiconductor Equipment Models Younghun Ahn.
NUS CS5247 Deadlock-Free and Collision-Free Coordination of Two Robot Manipulators By Patrick A. O’Donnell and Tomás Lozano-Pérez MIT Artificial Intelligence.
CY2003 Computer Systems Lecture 7 Petri net. © LJMU, 2004CY2003- Week 72 Overview Petri net –concepts –Petri net representation –Firing a transition –Marks.
A Graph Based Algorithm for Data Path Optimization in Custom Processors J. Trajkovic, M. Reshadi, B. Gorjiara, D. Gajski Center for Embedded Computer Systems.
Fuzzy Genetic Algorithm
A dynamic optimization model for power and performance management of virtualized clusters Vinicius Petrucci, Orlando Loques Univ. Federal Fluminense Niteroi,
Com & Net Call admission control (JABA-SD = MBA-SD) May 14, 2002 김 영 덕.
1 Part 2 & 3 Performance evaluation. 2 Goals Understand the complex behavior of systems subject to "random phenomena" Develop intuitive understanding.
Linear Programming Erasmus Mobility Program (24Apr2012) Pollack Mihály Engineering Faculty (PMMK) University of Pécs João Miranda
Seegrid.com Visualize Your Enterprise with Seegrid Robotic Solutions Robots: Creating Jobs by Unlocking Value Presentation to the Congressional Robotics.
Generalized stochastic Petri nets (GSPN)
Modelling by Petri nets
SCHEDULING IN FLEXIBLE ROBOTIC MANUFACTURING CELLS HAKAN GÜLTEKİN.
Ch5: Software Specification. 1 Petri Nets  Introduced by C. Adams Petri in  Widely used in the modeling and analysis of computer systems.  Basic.
CSCI1600: Embedded and Real Time Software Lecture 11: Modeling IV: Concurrency Steven Reiss, Fall 2015.
School of Computer Science & Software Engineering
A Novel Timing-Driven Global Routing Algorithm Considering Coupling Effects for High Performance Circuit Design Jingyu Xu, Xianlong Hong, Tong Jing, Yici.
Dr.-Ing. Peter Zeiler Institute of Machine Components Department: Reliability Engineering Workshop: Machine Availability and Dependability.
Balanced Billing Cycles and Vehicle Routing of Meter Readers by Chris Groër, Bruce Golden, Edward Wasil University of Maryland, College Park American University,
J.Vaitkus, L.Makarenko et all. RD50, CERN, 2012 The free carrier transport properties in proton and neutron irradiated Si(Ge) (and comparison with Si)
ASSEMBLY AND DISASSEMBLY: AN OVERVIEW AND FRAMEWORK FOR COOPERATION REQUIREMENT PLANNING WITH CONFLICT RESOLUTION in Journal of Intelligent and Robotic.
A VALUE-ADDED SYSTEM FOR EVALUATING CURRICULA OR COURSES OF STUDY AGAINST ACCREDITATION CRITERIA—A PETRI-NET APPROACH Johnnie B. Linn III, Division of.
Dr. Eng Amr T. Abdel-Hamid
COP 4600 Operating Systems Fall 2010
Computation of Minimal Siphons for a Class of Generalized Petri Nets
SystemC and OO-Synthesis
CSCI1600: Embedded and Real Time Software
دانشگاه شهیدرجایی تهران
تعهدات مشتری در کنوانسیون بیع بین المللی
COP 4600 Operating Systems Fall 2010
Modeling based on Petri-nets.
Dr. Mengchu Zhou Professor Department of Electrical and
CSE 542: Operating Systems
CSCI1600: Embedded and Real Time Software
Presentation transcript:

Yan Qiao and Naiqi Wu Guangdong University of Technology, Guangdong University of Technology, China China Mengchu Zhou New Jersey Institute of Technology, New Jersey Institute of Technology, USA USA

Semiconductor Manufacturing  Cluster Tools  Better utilization of Space  Higher yield  Better quality TM PMs Cassette module Transport module Processing modules

 Configuration –A dual arm robot –Process modules (PM) –Loadlocks (LL) –No intermediate buffer  Operated by Swap Strategy

 Single wafer type  3 steps (operations)  Operations 2 and 3 form a revisiting process: typical atomic layer deposition process  Situations considered: revisiting k = 2 times Consider Wafer Revisiting

 Processes with revisiting –Work by Lee et al. (Korea)  It is for single-arm cluster tools and not applicable for dual-arm ones  It involves complex computation –Work by Wu et al. (China)  The process never reaches steady-state  Two methods to operate the system  It is not optimal for some cases –Work by Qiao et al. (China)  Cycle time analysis for dual-arm cluster tools with k-time revisiting, k > 2  It is not optimal for some cases

 A generic Petri net model  Properties of cluster tools scheduled by 3-wafer schedule –It is not optimal for some cases  A novel scheduling method –It is optimal

 Places and Transitions p L : loadlocks with K(p 0 )=  and M 0 (p 0 )=n p i : wafer processing at step i with K(p i )= 1 t ij : robot moving from Step i to Step j q ij : model a robot arm waiting at Step i c p : a control place  Initial state M 0 (p i ) = K(p i ) and M 0 (q ij ) = 0, i  N 3, j  N 3  control function

Transition or place Time duration t L1  +  t 12, t 23, t 32  t 3L  +  pipi aiai t i0 and t i0 qi1qi1 i1i1 qi2qi2 i2i2 qi3qi3 i3i3

 Wu et al – When k = 2 – System starts from the idle state – Three local cycles with PM 2 and PM 3 – Three global cycles with PM 1, PM 2 and PM 3 – Three wafers are completed – 3-Wafer Schedule – It is not optimal for some cases 3-Wafer Schedule

Example: A 2 =120, A 3 =125, =21,  = 2, starting from the idle state The robot waiting times are changing with a number of cycles to reaching its steady state Finally, the robot waits at Step i with A i being the largest one and it does not wait at other steps If the robot does not wait at Step i, the wafer sojourn time  i > A i, or a wafer processing delay occur CycleWaiting time before swapping at p 2 Waiting time before swapping at p ………

 The state of the system: M = {  1,  2,  3,  4 }   i, i  N 3, represents the wafers in PM i,   4 represents the wafers held by robot.  W d (q) represents the d-th wafer is being processed or to be processed for q-th operation in p i.

 Consider 2 times revisits  The marking evolution of the PN: M 1 = {W 4 (1), W 3 (2), W 2 (3), W 1 (5)}  M 2 = {W 4 (1), W 2 (4), W 1 (5), W 3 (3)}  M 3 = {W 5 (1), W 4 (2), W 3 (3), W 2 (5)} M 1 to M 2 : Firing sequence is {swapping at p 3  t 32  swapping at p 2  t 23 } M 2 to M 3 : Firing sequence is{swapping at p 3  t 3L  t L1  swapping at p 1  t 12  swapping at p 2  t 23 }

 One local cycles with PM 2 and PM 3  One global cycles with PM 1, PM 2 and PM 3  One wafers are completed  1-Wafer Schedule  It is optimal 1-Wafer Schedule

 Contribution  A Petri net model for the ALD process  A novel scheduling method  It is optimal.  Future work  Consider wafer residency time constraint  Subject to bounded activity time variation

Thank you for attention!