0% found this document useful (0 votes)
9 views33 pages

chapter 4 simu

The document discusses discrete event simulation (DES), which models systems where changes occur at distinct events, such as customer arrivals in queues. It compares fixed time step and next event simulation models, highlighting the efficiency of the next event model despite its complexity. Additionally, it covers applications of DES in various fields, programming tasks, and methods for gathering statistics and measuring utilization in simulations.

Uploaded by

210313kalyan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
9 views33 pages

chapter 4 simu

The document discusses discrete event simulation (DES), which models systems where changes occur at distinct events, such as customer arrivals in queues. It compares fixed time step and next event simulation models, highlighting the efficiency of the next event model despite its complexity. Additionally, it covers applications of DES in various fields, programming tasks, and methods for gathering statistics and measuring utilization in simulations.

Uploaded by

210313kalyan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 33

Discrete System Simulation

Chapter 4
Prepared by : Sagar Bhandari

Prepared By : Sagar Bhandari


Discrete Event Simulation

Discrete system is a system in which the


changes are discontinuous. Each change in the
state of system is called as an event. For
Example, arrival or departure of a customer in a
queue is an event. The simulation of a discrete
system is referred to as discrete event
simulation.

Prepared By : Sagar Bhandari


Application of DES


It is used by operation research workers to study large
complex systems which cannot be studied by
analytical method.

In inventory control.

Study of sea and airport.

Steel melting stuffs.

Telephone exchanges.

Production line.

Project scheduling etc.
Prepared By : Sagar Bhandari
Fixed Time VS Next Event Model


In a fixed time step model a timer or clock is
simulated by the computer.

This clock is updated by a fixed time interval Ϫ
and the system is examine to see if any event
has taken place during this time interval.

All events that place during this period are
treated as if they occur simultaneously at the
tail end of this interval.

Prepared By : Sagar Bhandari


Fixed Time VS Next Event Model


In the next event simulation model, the
computer advances time to the occurrence of
the next event. It shifts from event to event.

The system does not change in between only
those points in time are kept track when
something of interest happens to the system

Prepared By : Sagar Bhandari


Illustration

To illustrate the difference between the two modules, let us


assume that we are simulating the dynamics of population in
a fish bowl staring with 10 fishes. If the fixed time step model
is used with the interval “ τ= 1 day” then the fish bowl would
see once every 24 hrs and any births and deaths that take
place are presume to be during the last moment of this
period. But the next event model is used, then we first find
out when the next event birth and death is to be take place
then advance the clock exactly to that time. The next event
model is preferred because it does not waste any computed
time is scanning those points in time when nothing take
place. The only drawback of the next event model is that its
implementation is more complicated than the fixed time step
model.
Prepared By : Sagar Bhandari
Generation of Arrival Patterns
Trace Driven Simulation


Here the sequence of inputs are generated
from observations of a running system.

Programs monitors are attached to the running
system to extract the data with little or no
disturbances of the system operation.

Prepared By : Sagar Bhandari


Bootstrapping

Here the arrival time of the next entity is immediately
calculated from the inter-arrival time distribution.

The term bootstrapping is used to describe this process of
making one entity create its successor.

The method requires keeping only the arrival time of the
next entity.

It is the most preferred method of generating arrival
through computer simulation program.

The attributes for arriving entity can be assigned at the
generation time or later on depending on the requirement.

If the attributes do not affect the event execution, then the
attributes can be assigned later on.

Prepared By : Sagar Bhandari


Simulation of Telephone System

The System has a number of Telephone


connecting to a switch board by lines. A
switch has a number of links which can
be used to connect any two lines subject
to the condition that only one connecting at
a time can be made to each line. It
assume that it lost call system i.e. any call
that can be connected at time immediately
it abandon. A call may be lost because no
link is available it is called as a lost call.
Prepared By : Sagar Bhandari
Simulation of Telephone System

The object of the simulation is to process a


given number of calls and determine what
proportion are successfully completed block or
busy. The current state of the system is that lne-
2 is connected to line-5 and a line-4 is
connected to line-7.Each line is treated as an
entity and it’s availability is an attribute a table
of numbers is establish which show the current
status of each line. A zero in the table means
the line is free and where 1 means it is busy.
Prepared By : Sagar Bhandari
Simulation of Telephone System

Prepared By : Sagar Bhandari


SoTS

Prepared By : Sagar Bhandari


SoTS

Prepared By : Sagar Bhandari


SoTS

Prepared By : Sagar Bhandari


SoTS

Prepared By : Sagar Bhandari


SoTS

Prepared By : Sagar Bhandari


SoTS

Prepared By : Sagar Bhandari


Delayed Calls

Prepared By : Sagar Bhandari


Delayed Calls

Prepared By : Sagar Bhandari


Prepared By : Sagar Bhandari
Prepared By : Sagar Bhandari
Prepared By : Sagar Bhandari
Simulation Programming Tasks


Outlining in general the tasks involved in
preparing a computer program for a simulation

Mainly : a. Generating Model and Initializing
b. Programming Procedure(Simulate)
c. Generating outputs

System Image : Represents state of system

Routines : Creates Discrete events which
makes changes to system image

Prepared By : Sagar Bhandari


Simulation Programming Tasks

Prepared By : Sagar Bhandari


Simulation Programming Tasks

1) Find next potential event


2)Select an activity
3)Test if the event can
be executed(either
abandoned like lost call
or executed later when condition
is suitable(conditional event))
4)Change the system image
5)Gather statistics
Prepared By : Sagar Bhandari
Gathering Statistics

Program includes report generator and


commonly required statistics are:

Prepared By : Sagar Bhandari


Counters and Summary Statistics


Being basis for most statistics counters are
mostly used to accumulate totals and also
recording current values of some levels.(viz:
telephone system)

Means and standard Deviation

Prepared By : Sagar Bhandari


Measuring Utilization and Occupancy

Equipment Free tf

Simulation measures load on Equipment Busy t b

T
End of
some entity ie. what fraction was simulation

engaged during simulation run Fig : Utilization of equipment time


To measure : Necessary to keep record of time
● The interval tb- tf is derived and added to counter

Utilization(U)=

Prepared By : Sagar Bhandari


Memory Utilization and Occupancy

Average Number in use :

Prepared By : Sagar Bhandari


Memory Utilization and Occupancy

Prepared By : Sagar Bhandari


Recording Distribution and Transit Times


To determine the distribution of a variable, we
need to count the no. of times the value of the
variable falls within specific intervals for each
new value, it is compared with predefined
intervals and for that interval, counted up once
All information is kept in a table that requires;
– The lower limit of tabulation (L)
– The interval size (dx)
– The number of intervals (N)

Prepared By : Sagar Bhandari


Recording Distribution and Transit Time

To measure transit times, the clock is used in


the manner of a time stamp i.e. each entity
holds time stamp. When entity reaches a point
from which transit time is started, the arrival
time is noted. Later when the entity reaches to
end point, the difference is computed

Prepared By : Sagar Bhandari


Discrete Simulation Languages


To change conceptual model to computational
model (here : writing discrete system simulation
programs)

Establish system image and execute simulation
algorithm

Eg’s: GPSS, SIMSCRIPT, FORTRANT,
VERILOG,VHDL etc.

Prepared By : Sagar Bhandari

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy