TexPoint fonts used in EMF.

Slides:



Advertisements
Similar presentations
Many useful applications, especially in queueing systems, inventory management, and reliability analysis. A connection between discrete time Markov chains.
Advertisements

Parallel and Distributed Simulation
Modeling & Simulation. System Models and Simulation Framework for Modeling and Simulation The framework defines the entities and their Relationships that.
 1  Outline  performance measures for a single-server station  discrete-event simulation  hand simulation  process-oriented simulation approach.
Simulation. Example: A Bank Simulator We are given: –The number of tellers –The arrival time of each customer –The amount of time each customer requires.
Simulation Where real stuff starts. ToC 1.What, transience, stationarity 2.How, discrete event, recurrence 3.Accuracy of output 4.Monte Carlo 5.Random.
Queuing Analysis Based on noted from Appendix A of Stallings Operating System text 6/10/20151.
Classification of Simulation Models
Simulation with ArenaChapter 2 – Fundamental Simulation Concepts Discrete Event “Hand” Simulation of a GI/GI/1 Queue.
Discrete Event Simulation Event-Oriented Simulations By Syed S. Rizvi.
Probability theory 2011 Outline of lecture 7 The Poisson process  Definitions  Restarted Poisson processes  Conditioning in Poisson processes  Thinning.
CPSC 531: DES Overview1 CPSC 531:Discrete-Event Simulation Instructor: Anirban Mahanti Office: ICT Class Location:
Lecture 4 Mathematical and Statistical Models in Simulation.
Lab 01 Fundamentals SE 405 Discrete Event Simulation
Cmpt-225 Simulation. Application: Simulation Simulation  A technique for modeling the behavior of both natural and human-made systems  Goal Generate.
Graduate Program in Engineering and Technology Management
Simulation II IE 2030 Lecture 18. Outline: Simulation II Advanced simulation demo Review of concepts from Simulation I How to perform a simulation –concepts:
The Poisson Process. A stochastic process { N ( t ), t ≥ 0} is said to be a counting process if N ( t ) represents the total number of “events” that occur.
ETM 607 – Discrete Event Simulation Fundamentals Define Discrete Event Simulation. Define concepts (entities, attributes, event list, etc…) Define “world-view”,
TexPoint fonts used in EMF.
Chapter 2 – Fundamental Simulation ConceptsSlide 1 of 46 Chapter 2 Fundamental Simulation Concepts.
CDA6530: Performance Models of Computers and Networks Chapter 7: Basic Queuing Networks TexPoint fonts used in EMF. Read the TexPoint manual before you.
Simulation Examples and General Principles
CDA6530: Performance Models of Computers and Networks Chapter 8: Statistical Simulation --- Discrete-Time Simulation TexPoint fonts used in EMF. Read the.
NETW 707 Modeling and Simulation Amr El Mougy Maggie Mashaly.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 25 Simulation.
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,
CDA6530: Performance Models of Computers and Networks Mid-Term Review TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.:
Dr. Anis Koubâa CS433 Modeling and Simulation
(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.
CDA6530: Performance Models of Computers and Networks Chapter 8: Statistical Simulation ---- Discrete Event Simulation (DES) TexPoint fonts used in EMF.
CS433 Modeling and Simulation Lecture 09 – Part 02 Discrete Events Simulation Dr. Anis Koubâa 27 Dec 2008 Al-Imam.
SS r SS r This model characterizes how S(t) is changing.
Introduction The objective of simulation – Analysis the system (Model) Analytically the model – a description of some system intended to predict the behavior.
Simulation Examples And General Principles Part 2
CDA6530: Performance Models of Computers and Networks Chapter 8: Statistical Simulation ---- Discrete Event Simulation (DES) TexPoint fonts used in EMF.
Discrete-Event System Simulation in Java. Discrete Event Systems New dynamic systems New dynamic systems Computer and communication networks Computer.
Chapter 1 What is Simulation?. Fall 2001 IMSE643 Industrial Simulation What’s Simulation? Simulation – A broad collection of methods and applications.
CDA6530: Performance Models of Computers and Networks Mid-Term Review TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.:
Introduction to Simulation What is a simulation? A system that represents or emulates the behavior of another system over time; a computer simulation is.
PDES Introduction The Time Warp Mechanism
OPERATING SYSTEMS CS 3502 Fall 2017
Data Structures Using C++ 2E
Parallel and Distributed Simulation
Models of Traffic Flow 1.
Modeling and Simulation (An Introduction)
ADVANTAGES OF SIMULATION
2.7: Simulation.
Discrete Event Simulation
COMPUTER 2430 Object Oriented Programming and Data Structures I
Chapter 10 Verification and Validation of Simulation Models
CDA6530: Performance Models of Computers and Networks Project 3 Q&A
TexPoint fonts used in EMF.
TexPoint fonts used in EMF.
Parallel and Distributed Simulation
More Explanation of an example in chapter4
TexPoint fonts used in EMF.
TexPoint fonts used in EMF.
TexPoint fonts used in EMF.
COMP60611 Fundamentals of Parallel and Distributed Systems
Discrete Event “Hand” Simulation of a GI/GI/1 Queue
Priority Queues Chapters 10 & 26.
CDA6530: Performance Models of Computers and Networks Project 3 Q&A
Fundamental Simulation Concepts
Discrete Event Simulation
MECH 3550 : Simulation & Visualization
Chapter 4: Simulation Designs
Where real stuff starts
Discrete Mathematics CS 2610
Presentation transcript:

TexPoint fonts used in EMF. CDA6530: Performance Models of Computers and Networks Chapter 9: Statistical Simulation ----Discrete Event Simulation (DES) TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAAAAAAAAAA

Time Concept physical time: time in the physical system Noon, Oct. 14, 2008 to noon Nov. 1, 2008 simulation time: representation of physical time within the simulation floating point values in interval [0.0, 17.0] Example: 1.5 represents one and half hour after physical system begins simulation wallclock time: time during the execution of the simulation, usually output from a hardware clock 8:00 to 10:23 AM on Oct. 14, 2008

Discrete Event Simulation Computation example: air traffic at an airport events: aircraft arrival, landing, departure arrival 8:00 schedules processed event current event unprocessed event departure 9:15 arrival 9:30 landed 8:05 schedules simulation time Unprocessed events are stored in a pending event list Events are processed in time stamp order From: http://www.cc.gatech.edu/classes/AY2004/cs4230_fall/lectures/02-DES.ppt

DES: No Time Loop Discrete event simulation has no time loop There are events that are scheduled. At each run step, the next scheduled event with the lowest time schedule gets processed. The current time is then that time, the time when that event is supposed to occur. Accurate simulation compared to discrete-time simulation Key: We have to keep the list of scheduled events sorted (in order)

Variables Time variable t Counter variables Simulation time Add time unit, can represent physical time Counter variables Keep a count of times certain events have occurred by time t System state (SS) variables We focus on queuing systems in introducing DES

Interlude: Simulating non-homogeneous Poisson process for first T time Arrival rate is a variable ¸(t) Bounded: ¸(t) < ¸ for all t<T Thinning Method: t=0, I=0 Generate a random number U t=t-ln(U)/¸. If t>T, stop. If U· ¸(t)/¸, set I=I+1, S(I)=t Go to step 2 Final I is the no. of events in time T S(1), , S(I) are the event times Remove step 4 and condition in step 5 for homogeneous Poisson

Subroutine for Generating Ts Nonhomogeneous Poisson arrival Ts: the time of the first arrival after time s. Let t =s Generate U Let t=t-ln(U)/¸ If U· ¸(t)/¸, set Ts=t and stop Go to step 2

Subroutine for Generating Ts Homogeneous Poisson arrival Ts: the time of the first arrival after time s. Let t =s Generate U Let t=t-ln(U)/¸ Set Ts=t and stop

M/G/1 Queue Variables: Events: Time: t Counters: NA: no. of arrivals by time t ND: no. of departures by time t System state: n – no. of customers in system at t eventNum: counter of # of events happened so far Events: Arrival, departure (cause state change) Event list: EL = tA, tD tA: the time of the next arrival after time t TD: departure time of the customer presently being served

Output: A(i): arrival time of customer i D(i): departure time of customer I SystemState, SystemStateTime vector: SystemStateTime(i): i-th event happening time SystemState(i): the system state, # of customers in system, right after the i-th event.

Initialize: Set t=NA=ND=0 Set SS n=0 Generate T0, and set tA=T0, tD=1 Service time is denoted as r.v. Y tD= Y + T0

If (tA· tD) (Arrival happens next) t=tA (we move along to time tA) NA = NA+1 (one more arrival) n= n + 1 (one more customer in system) Generate Tt, reset tA = Tt (time of next arrival) If (n=1) generate Y and reset tD=t+Y (system had been empty before without tD determined, so we need to generate the service time of the new customer)

Collect output data: A(NA)=t (customer NA arrived at time t) eventNum = eventNum + 1; SystemState(eventNum) = n; SystemStateTime(eventNum) = t;

If (tD<tA) (Departure happens next) t = tD n = n-1 (one customer leaves) ND = ND+1 ( departure number increases 1) If (n=0) tD=1; (empty system, no next departure time) else, generate Y and tD=t+Y (why?)

Collect output data: D(ND)=t eventNum = eventNum + 1; SystemState(eventNum) = n; SystemStateTime(eventNum) = t;

Summary Analyzing physical system description Represent system states What events? Define variables, outputs Manage event list Deal with each top event one by one