Modeling Worldviews Event Scheduling – Event Graphs State Machines Activity Scanning – Event Graphs and Petri Nets Process Interaction – Event Graphs and.

Slides:



Advertisements
Similar presentations
Processes Management.
Advertisements

Global States.
Arena modeling Conceptual model can be converted into Arena model. Arena model: connected building blocks. Building blocks must be parameterized. Arena.
Solutions for Scheduling Assays. Why do we use laboratory automation? Improve quality control (QC) Free resources Reduce sa fety risks Automatic data.
 1  Outline  performance measures for a single-server station  discrete-event simulation  hand simulation  process-oriented simulation approach.
Chapt 6 Resources & Gates Intro/ steps in the process Distributions...What & Why Resource Block Await Node Free node Alter node Group block Open Node Close.
Lecture 3 Concepts of Discrete-Event Simulation. 2 Discrete Event Model  In the discrete approach to system simulation, state changes in the physical.
Oliver Rose Dresden University of Technology Department of Computer Science Chair for Modeling and Simulation Benefits and Drawbacks of Simple Models for.
Chapter 3 Simulation Software
Ordering and Consistent Cuts Presented By Biswanath Panda.
DISCRETE-EVENT SIMULATION CONCEPTS and EVENT SCHEDULING ALGORITHM
1 Lecture 6 Performance Measurement and Improvement.
Review: Process Management Objective: –Enable fair multi-user, multiprocess computing on limited physical resources –Security and efficiency Process: running.
Simulation with Arena, 3 rd ed.Chapter 11 – Continuous & Combined Discrete/Continuous ModelsSlide 1 of 11 Continuous and Combined Discrete/ Continuous.
Performance Analysis and Monitoring Facilities in CPN Tools Tutorial CPN’05 October 25, 2005 Lisa Wells.
Distributed Process Management
Modeling Worldviews Activity Scanning – Petri Nets and Event Graphs Event Scheduling – Event Graphs State Machines Process Interaction –Block Flow Diagrams.
Components and Organization of Discrete-event Simulation Model
Inside Discrete-Event Simulation Software: How It Works and Why It Matters Thomas J. Schriber, Daniel T. Brunner WSC05’ Presented by Geng Yue Mar 24.
Ref: Peter Haas’ book on Stochastic Petri Nets – resets all timers each scan, prob. deposit Remove on Fire rule – vs Remove on enable (Ref: Fishwick) Simulation.
Modeling State-Dependent Objects Using Colored Petri Nets
Simulation Waiting Line. 2 Introduction Definition (informal) A model is a simplified description of an entity (an object, a system of objects) such that.
CPSC 531: DES Overview1 CPSC 531:Discrete-Event Simulation Instructor: Anirban Mahanti Office: ICT Class Location:
Lab 01 Fundamentals SE 405 Discrete Event Simulation
Mapping Petri Nets into Event Graphs. Alternative Implementations Activity World View Petri Net Formalism: Simple fundamental elements and behavior Concurrent.
 1  Outline  simulating GI/G/1 queues  M/M/1 queues  theoretical results of queueing systems  an inventory system  simulation program with an event.
Layers and Views of a Computer System Operating System Services Program creation Program execution Access to I/O devices Controlled access to files System.
Slide - 1 Dr Terry Hinton 6/9/05UniS - Based on Slides by Micro Analysis & Design An example of a Simulation Simulation of a bank: Three tasks or processes:
Ming Zhou, PhD., Associate Professor
Modeling and Simulation
Simulation Concepts Dr. Jason Merrick. Simulation with Arena — A Quick Peek at Arena C3/2 The above was just one “replication” -- a sample of size one.
Designing a Discrete Event Simulation Tool Peter L. Jackson School of Operations Research and Industrial Engineering March 15, 2003 Cornell University.
T. E. Potok - University of Tennessee Software Engineering Dr. Thomas E. Potok Adjunct Professor UT Research Staff Member ORNL.
Lecture 2 Process Concepts, Performance Measures and Evaluation Techniques.
Slide 1 of 68 Modeling Detailed Operations. Slide 2 of 68 What We’ll Do... Explore lower-level modeling constructs Model 5-1: Automotive maintenance/repair.
ETM 607 – Discrete Event Simulation Fundamentals Define Discrete Event Simulation. Define concepts (entities, attributes, event list, etc…) Define “world-view”,
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 7 OS System Structure.
Chapter 2 – Fundamental Simulation ConceptsSlide 1 of 46 Chapter 2 Fundamental Simulation Concepts.
1 Distributed Process Management Chapter Distributed Global States Operating system cannot know the current state of all process in the distributed.
Multiprogramming. Readings r Silberschatz, Galvin, Gagne, “Operating System Concepts”, 8 th edition: Chapter 3.1, 3.2.
Modeling and Simulation Discrete-Event Simulation
Arena Simulation Language. Simulation with ArenaChapter 3 – A Guided Tour Through ArenaSlide 2 of 58 The Create Flowchart Module “Birth” node for entities.
Introduction Object oriented design is a method where developers think in terms of objects instead of procedures or functions. SA/SD approach is based.
Chapter 2 Fundamental Simulation Concepts
MODELING EXAMPLES Types of model Conceptual Containing components that have not been clearly Identified in terms of theoretic categories such as state,
Arena Detailed Modeling. Nonstationary Arrival Process Stationary Poisson Process – mean rate is a constant Nonstationary Poisson Process – mean arrival.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 3: Process-Concept.
Simulation of Operations The Discrete Event Approach to Computer Modelling.
Jonathan Atzmon, ISE/ETM Dr. Joan Burtner, Advisor Last Revised 03/03/15 Atzmon ETM , Simulation in Healthcare, Spring 2015, Dr. Joan Burtner 1.
Operating Systems (CS 340 D) Dr. Abeer Mahmoud Princess Nora University Faculty of Computer & Information Systems Computer science Department.
COMP155 Computer Simulation September 10, Discrete Event Simulation  discrete event simulation: state variable change only at a discrete set of.
Advantages of simulation 1. New policies, operating procedures, information flows and son on can be explored without disrupting ongoing operation of the.
 Simulation enables the study of complex system.  Simulation is a good approach when analytic study of a system is not possible or very complex.  Informational,
Unit 4 Simulation software. Introduction Software used to develop simulation models can be divided into 3 categories: – General-purpose programming languages:
Simulation Examples And General Principles Part 2
Parallel and Distributed Simulation Deadlock Detection & Recovery: Performance Barrier Mechanisms.
CS3771 Today: Distributed Coordination  Previous class: Distributed File Systems Issues: Naming Strategies: Absolute Names, Mount Points (logical connection.
Discrete-Event System Simulation in Java. Discrete Event Systems New dynamic systems New dynamic systems Computer and communication networks Computer.
Introduction to Modeling & Simulation Dr. A. K. Dey Third Lecture
One More Try Another Example with Some Tweaks. Fall 2001IMSE 643 Industrial Simulation Two Job Types and a second Workstation Machine Inspection Arrivals.
1 Simulation Software. 2 Introduction The features that should be programmed in simulation are: Generating random numbers from the uniform distribution.
Chapter 1 What is Simulation?. Fall 2001 IMSE643 Industrial Simulation What’s Simulation? Simulation – A broad collection of methods and applications.
Introduction to Simulation What is a simulation? A system that represents or emulates the behavior of another system over time; a computer simulation is.
Operating Systems (CS 340 D)
Lecture 8: Arena: Entity Transfer
Discrete Event Simulation
THINGS YOU SHOULD KNOW ABOUT JOB SCHEDULING. One such automation tool to run the essence of any organization or enterprise is Job scheduling. It is the.
ميرعماد سليمانيان محمدرضا صمدي ميلاد ظفرنژاد.
World-Views of Simulation
Welcome To My Presentation. Presentation on How discrete-event simulation software works and why it matters.
Presentation transcript:

Modeling Worldviews Event Scheduling – Event Graphs State Machines Activity Scanning – Event Graphs and Petri Nets Process Interaction – Event Graphs and Block Diagrams

Resident Entities Variables describe the state. Focus on cycles. (busy-idle-busy...) Transient Entities Variables describe state and location. Focus on flow paths. System Entities

Block Languages Process “World View” Focus on Transient Entity Flow – “JOB DRIVEN”. Preprogrammed blocks of code. Block execution is triggered by a Transient Entity entering a block. Execution Controlled by Job Moves. Common Languages Arena (Siman), AutoMod, GPSS, SLAM (AweSim)

Block Languages Common Languages SLAM SIMAN GPSS (fundamental Blocks) Generate - Transactions enter model Queue - Transactions wait for facility Seize - Transactions take resource Depart - Transactions leave queue Advance - Transactions are delayed Release - Transactions release resource Terminate - Transactions leave the model

Block Languages Common Languages SLAM SIMAN (fundamental blocks) GPSS Create - Entities enter model Queue - Entities wait for facility Seize - Entities take resource Depart - Transactions leave queue Delay - Entities are delayed Release - Entities release resource (Entities may leave using “Dispose” )

Single Queue QUEUE SEIZE DEPART ADVANCE RELEASE GENERATE TERMINATE GPSSSIMAN CREATE DELAY RELEASE 1 QUEUE SEIZE 1 1

Main Event Scheduling Algorithm for Process Interaction Cancel Events Initialize Advance Clock to Time of Next Event Execute Event Remove Event From List and move “tokens” until blocked or delayed State Event List Change State Schedule Events Summary Statistics Stop Yes No

Loading Unloading Processing Time Labor Modeling “Machine Interference” tool1 Oper. tool2 Loading Processing Unloading

QUEUE SEIZE GENERATE TERMINATE 1 1 SEIZE 2 DEPART Load RELEASE 1 1 Cycle RELEASE 2 SEIZE 1 RELEASE 1 Unload Semiautomatic Machine Worker is Resource 1 Machine is Resource 2

Single Queue with Failures SIMAN CREATE DELAY RELEASE 1 QUEUE SEIZE 1 1 CREATE DELAY RELEASE 1 QUEUE SEIZE 1 1 (Job Processing) (Failure Processing) TTR TBF Proc. time IA time HIGH PRIORITY JOB

Siman Blocks View (File/Template/Attach/Blocks) This is what the Arena Processes view generates.. Eventually you will need to understand this to use Arena In a real problem...

Bank Queue with Jockeying

; ***************************** ; * Mechanical Failures * ; *************************** CREATE; ASSIGN: J = 0; DUPLICATE:NumSegs-1; !create entity for each segment ASSIGN: J = J + 1: !increment counter SegNum = J; !set segment number MechLoop DELAY: ED(MTBF(SegNum)); !delay for mean time btwn failures QUEUE, MechFail1_Q; !wait for machine SEIZE: Mach(SegNum); !seize machine ASSIGN: MStat(SegNum) = 6: !segment status to mech fail State = 0; BRANCH,2: IF,TR_Policy.EQ.2.OR.TR_Policy.EQ.3,PM: ALWAYS,M_Rep; M_Rep ASSIGN: DTime = ED(MTR(SegNum)); !assign mean time to repair TALLY: MechFail_1 + SegNum - 1, DTime; DELAY: DTime; !delay for mean time to repair BRANCH,1: IF,TR_Policy.EQ.2.OR.TR_Policy.EQ.3,PM_GetR: ELSE,MF_Done; MF_Done ASSIGN: MStat(SegNum) = 2; !segment status to starved RELEASE: Mach(SegNum): !release machine NEXT(MechLoop);

Block Languages Process World View: +Transient Entity Focus Helps Animation +Easy to Use for Simple Applications -Limited to Pre-programmed blocks -Difficult to Model Complex Logic -Difficult to Model Resource Failure or (say, on amount of time worked.) -Hard to Learn Well -Simulation Slows (or stops) as the System Becomes Congested ! ! !

Block Languages Why the simulation slows (or stops) as the system becomes congested. A record of each active transient entity must be maintained during a run. e.g.: Process Flow in a semi-conductor fabrication facility. A resident entity model will run hundreds of times faster.

Block Languages Resident Entity models are required to have practical simulations of any system with many active transient entities. e.g. Communications Networks Large Scale Manufacturing Systems and Continuous Flow Processes

Screen Capture of ARENA Output: Svc Time = 1.85 Ref: Kim Branch and Jay Gillespie

Maximum of 100 Entities Exceeded! (Svc Time = 18.5) What is the effect on Bias of ignoring runs that did not terminate correctly?

Resource/Job Driven Simulations

RunTime Ratios

Speed comparisons with Automod ASAP

Little Slowdown from using PUT/GET

Using Activity Scanning to Develop Process Models “Color” tokens that represent Transient Entities - - track these tokens’ paths. Parse Activities into “SEIZE”, “DELAY” and “RELEASE” Blocks. SEIZE DELAY RELEASE Idle Resources Queue

Process -> EG Mapping Process World View: Automated SLAM to Event Graphs (Woodward and Mackulak, ASU) Resource deadlock detection SIMAN to Event Graphs (Barton and Gonzalez, PSU) Premature run termination

Notes: 1.Model "footprint" is "number of servers" not "size of queue" - insensitive to congestion – complexity grows with resources! 2. Q statistics are O.K. but what about Delays? - ambiguity of the mystery blocks - Use Little's Law or transient entity (PUT/GET) method. (S>0) (Q>0) T A GEN 1 QUEUE DEPART T S SEIZE RELEASE yes TERM yes TERM 1 1 1

Conventional EG Model SEIZERelease {Q=Q+1}{R=R-1, Q=Q-1} {R=R+1} (R>0) (Q>0) QUEUE TaTa TsTs

NOTE: Can change Distns.dat while model is running! //CREATE block 1 - interval.5*TRI{.5} //DELAY block 1 - duration 2*TRI{.5} //DELAY block 2 -duration 2+3*BET{.5;.5}

Run (S[0],S[1]) Enter { I=(Q[0]>10), Q[I]++ } Start (I) Finish (I) I ~ (Q[I]) tStS tAtA {Q[I]--, S[I]--} { S[I]++ } I ~ (S[I])