SlideShare a Scribd company logo
6
Most read
7
Most read
8
Most read
Output Analysis for a
terminating simulators




        Presented By :Saleem
        Almaqashi
                               1
Introduction
 – One realization (run) does not necessarily give
   the “correct” answer(s).
 – Variance exists in simulation results so we must
   be cautious about how we interpret results
 ◦ Output from our model {Y1, Y2, Y3, …}
 – {Y1, Y2, Y3, …} may not be independent;
 – {Y1, Y2, Y3, …} may have different distributions,
   depending on a number of different factors;
 – Estimators, confidence interval, and so on, must
   be constructed.


                                                       2
Types of Simulations with Regard to Output
  Analysis
              Terminating




Simulation                  Steady-state parameters
Systems

                            Steady-state cyclic parameters


             Non-terminating Dynamic parameters

              “Other
              parameters”   Transient parameters

                                                             3
Types of Simulations with
Regard to Output Analysis

 Terminating: Parameters to be estimated
  are defined relative to specific initial and
  stopping conditions that are part of the
  model
 There is a “natural” and realistic way to
  model both the initial and stopping
  conditions
 Output performance measures generally
  depend on both the initial and stopping
  conditions
                                                 4
Terminating: Examples
 Natural event “E” that specifies the length of each
  run.
 Ex.1: Bank opens from 9 to 5, E = {8 hours of
  simulation (9-5)}
 Ex.2: Military exercise Red vs. Blue, E = {Either
  Red or Blues wins}
 Ex.3: Manufacturing 100 products (random
  process), E = {Completion of the 100th product}
 Ex.4: Reliability simulation of a car (quality
  problems random), E = {First major quality problem
  occurs}



                                                        5
Non terminating
   Non terminating: There is no natural and realistic
    event that terminates the model Interested in “long-
    run” behavior characteristic of “normal” operation

   If the performance measure of interest is a
    characteristic of a steady-state distribution of the
    process, it is a steady-state parameter of the model
    .

   Theoretically, does not depend on initial conditions
   Practically, must ensure that run is long enough so
    that initial-condition effects have dissipated
                                                           6
Non terminating Examples
   Ex. 1 (Cyclic): An inventory system, say a retail
    store, replenishments are cyclic (e.g., monthly
    orders and arrivals of goods), but demand is
    random. The performance measure can be
    average monthly inventory level.
   Ex . 2 (Dynamic ) : Airport security system
    simulation (case study). Passenger volume varies
    by hour of day, day of the week. Performance
    measure – passenger waiting time (to get through
    security check point) is hourly.
   Ex.3 (Transient ) : Transportation (case study).
    Multiple-lane highway has one lane blocked (e.g.,
    accidents). Cars need to merge and traffic slows
    down. Performance measure: drive time during the
    traffic jam.
                                                        7
Terminating vs. Steady state
simulation




                               8
Terminating Simulations
     Statistics based on Observations
    ◦ Let Di = delay of ith customer in queue
           d = (the true value of) average delay in
      queue
      For m customer
               m                                m
                     Di   Estim ate
                                                      Di
               i 1                              i 1
      D ( m)                          d   lim              (true mean)
                m           m     m
    ◦ In general
      xj = measured performance from the run
         = E[x]
      Confidence Interval (of n runs):
                                                                             2
                                  S 2 (n)                                x
      x (n) tn     1,1    /2                          (Prisker used              )
                                     n                                   I
                                                                                     9
Terminating Simulations
   Replication Approach
    ◦ Independent runs with different RN streams/seeds but
      same I.C.’s, also need same number of observations
      for each run (conflict with statistics based on time-
      persistent variables)
    ◦ Ex: Run model 10 times with identical initial conditions
      xj - 1.051 6.438 2.646 0.805 1.505
           0.546 2.281 2.822 0.414 1.307
     Each one is the average of 35 observations
                 35 D
                       j
    x j D j (35)
                 j 1 35
     Compute:
            1   10                                (x j   X )2
    X (10)            x j (35) 1.982   S 2 (10)                 3.172
           10   j 1                                n 1
                                                                        10
Terminating Simulations
   Replication Approach
    ◦ Ex: (Continue)
      From the statistics table: use = 0.10 (t9,0.95 = 1.833)
      So, confidence interval of delay times
                3.172
    1.982 1.833       1.982 1.032
                 10
    0.950 d 3.014 witha 90% probabilit y
    ◦ Interpretation
       90% chance (probability) the true value is between
        0.950 and 3.014 (not “falls into”) or 90% that 0.950
        to 3.014 covers the true value
    ◦ Better answer    increased number of runs

                                                          11
Terminating Simulations
   Measure of Precision (Accuracy)
    ◦ Absolute vs. relative
      Half width of actual C.I. absolute precision
      Ratio of the half width to the magnitude of estimate
       relative precision of C.I.
    ◦ Determine how many runs are needed
      Assumption: S2(n) is not changing (within each run)
      Absolute Precision ( )

        *                                     S 2 (n)
       na ( ) min{i     n : ti    1,1    /2                 }
                                                 i
      Relative Precision ( )

                                             S 2 ( n)
                             ti   1,1   /2
         *
        n( )   min{i    n:                      i       }
         r
                                        X ( n)
                                                                12
Terminating Simulations
   Measure of Precision (Accuracy)
    ◦ In the previous Ex:
       Absolute precision ( ) = 1.032
         If we want C.I. = 1.982 0.5
       *                           3.172
     na (0.5) min{i 10 : ti 1,0.95         0.5}
                                     i
            *          2
     i.e., na ( ) f ( S (n))
        Continue to make additional runs       i = 37 (27 more runs)
       Relative precision ( ) = 1.032/1.982 = 0.521
        (i.e., 90% of prob. value is within 52% of the true mean)
        If we want = 0.15           3.172
                          ti 1,0.95
     *
    nr (0.15) min{i 10 :              i    0.15}
                                1.982
        Lead to    i = 99 (89 more runs)
                                                                 13
Terminating Simulations
   Sequential Procedure (to make multiple replications)
    1. Select the initial replication n0 2
    2. Compute (based on a selected )
                               S 2 (n)
         (n, ) tn   1,1   /2
                                  n

    3. Compute
                     (n, )
                                   ?     is determined - relative precision
                     X ( n)

    4. If yes   stop
       If not   n = n + 1 (one additional run)
                  and repeat steps 2, 3, and 4
                                                                       14
Terminating Simulations

    Sequential Procedure
     ◦ In practice, need to obtain statistics at the
       end of each replication (run)
Replicate 1:                        Estimate: x1, S12(x)

                clear stats - use new RN
                streams
           2:                       Estimate: x2, S22(x)
                   
      n0   2:                       Estimate: xn0, Sno2(x)
                                    Compute X(n0), S2(n0)
                                   Until
                   
                                                           S 2 ( n)
                                           tn   1,1   /2
           n:
                                                              n
                                                      X ( n)

                                                                      15
Conclusion
 Statistical methods are used to
  analyze the results of simulation
  experiments.
 Terminating: A simulation where there
  is a specific starting and stopping
  condition that is part of the model.




                                          16
17

More Related Content

PPT
parallel programming models
PPTX
Cloud sim
PPTX
GPU Computing
PDF
Aneka platform
PPTX
Fuzzy c means manual work
PPT
Parallel computing
PPTX
Introduction to Embedded Systems I : Chapter 1
parallel programming models
Cloud sim
GPU Computing
Aneka platform
Fuzzy c means manual work
Parallel computing
Introduction to Embedded Systems I : Chapter 1

What's hot (20)

PDF
Digital Signal Processing
PDF
Network classification
PDF
BUilt-In-Self-Test for VLSI Design
PDF
Centralized shared memory architectures
PPTX
The Future of Cloud Computing in 2021
PPTX
Interconnection Network
PPTX
4 bit counter
PPT
Multi processing
PPTX
Microkernel
PDF
Introduction to OpenMP (Performance)
PPTX
Pram model
PPTX
Energy & Power Signals |Solved Problems|
PDF
ARM Instructions
PPTX
EC8791 consumer electronics-platform level performance analysis
PPT
Distributed System
PPTX
Parallel processing
PPTX
PPTX
Superscalar & superpipeline processor
PPTX
Virtualization in cloud computing
PPTX
Parallel algorithms
Digital Signal Processing
Network classification
BUilt-In-Self-Test for VLSI Design
Centralized shared memory architectures
The Future of Cloud Computing in 2021
Interconnection Network
4 bit counter
Multi processing
Microkernel
Introduction to OpenMP (Performance)
Pram model
Energy & Power Signals |Solved Problems|
ARM Instructions
EC8791 consumer electronics-platform level performance analysis
Distributed System
Parallel processing
Superscalar & superpipeline processor
Virtualization in cloud computing
Parallel algorithms
Ad

Viewers also liked (6)

PPT
Random variate generation
PDF
Pseudo Random Number Generators
PPTX
Pseudorandom number generators powerpoint
PPTX
Random Number Generation
PPSX
Generate and test random numbers
Random variate generation
Pseudo Random Number Generators
Pseudorandom number generators powerpoint
Random Number Generation
Generate and test random numbers
Ad

Similar to Simulation in terminated system (20)

PPT
Estimate system performance via simulation If θ is the system performance, t...
PDF
1ST_UNIT_DAdefewfrewfgrwefrAdfdgfdsgevedr (2).pdf
PPTX
Data Structure Algorithm -Algorithm Complexity
PPTX
Condition Monitoring Of Unsteadily Operating Equipment
PDF
Chapter One.pdf
PPT
CS8451 - Design and Analysis of Algorithms
PPT
Big-O notations, Algorithm and complexity analaysis
PPT
Complexity Analysis
PPTX
The Delta Of An Arithmetic Asian Option Via The Pathwise Method
PPTX
Teknik Simulasi
PPTX
DS Unit-1.pptx very easy to understand..
PPT
PPTX
19. algorithms and-complexity
PPT
How to calculate complexity in Data Structure
PPTX
Time complexity.pptxghhhhhhhhhhhhhhhjjjjjjjjjjjjjjjjjjjjjjjjjj
PDF
Parallel R in snow (english after 2nd slide)
PDF
GDRR Opening Workshop - Variance Reduction for Reliability Assessment with St...
PPTX
UNIT I- Session 3.pptx
PPT
Time complexity.ppt
Estimate system performance via simulation If θ is the system performance, t...
1ST_UNIT_DAdefewfrewfgrwefrAdfdgfdsgevedr (2).pdf
Data Structure Algorithm -Algorithm Complexity
Condition Monitoring Of Unsteadily Operating Equipment
Chapter One.pdf
CS8451 - Design and Analysis of Algorithms
Big-O notations, Algorithm and complexity analaysis
Complexity Analysis
The Delta Of An Arithmetic Asian Option Via The Pathwise Method
Teknik Simulasi
DS Unit-1.pptx very easy to understand..
19. algorithms and-complexity
How to calculate complexity in Data Structure
Time complexity.pptxghhhhhhhhhhhhhhhjjjjjjjjjjjjjjjjjjjjjjjjjj
Parallel R in snow (english after 2nd slide)
GDRR Opening Workshop - Variance Reduction for Reliability Assessment with St...
UNIT I- Session 3.pptx
Time complexity.ppt

More from Saleem Almaqashi (7)

PPT
acceptance testing
PPT
Internet multimedia
PPT
Ai software in everyday life
PPT
Medical center using Data warehousing
PPT
acceptance testing
Internet multimedia
Ai software in everyday life
Medical center using Data warehousing

Recently uploaded (20)

PDF
NewMind AI Weekly Chronicles - August'25 Week I
PDF
Encapsulation_ Review paper, used for researhc scholars
PDF
Agricultural_Statistics_at_a_Glance_2022_0.pdf
PDF
CIFDAQ's Market Insight: SEC Turns Pro Crypto
PDF
The Rise and Fall of 3GPP – Time for a Sabbatical?
PDF
Approach and Philosophy of On baking technology
PPT
Teaching material agriculture food technology
PDF
TokAI - TikTok AI Agent : The First AI Application That Analyzes 10,000+ Vira...
PPTX
Detection-First SIEM: Rule Types, Dashboards, and Threat-Informed Strategy
PDF
Build a system with the filesystem maintained by OSTree @ COSCUP 2025
PDF
Advanced methodologies resolving dimensionality complications for autism neur...
PDF
Modernizing your data center with Dell and AMD
PDF
Machine learning based COVID-19 study performance prediction
PDF
How UI/UX Design Impacts User Retention in Mobile Apps.pdf
PPTX
PA Analog/Digital System: The Backbone of Modern Surveillance and Communication
PDF
Electronic commerce courselecture one. Pdf
PPTX
Digital-Transformation-Roadmap-for-Companies.pptx
PPTX
Understanding_Digital_Forensics_Presentation.pptx
PDF
Diabetes mellitus diagnosis method based random forest with bat algorithm
PDF
Unlocking AI with Model Context Protocol (MCP)
NewMind AI Weekly Chronicles - August'25 Week I
Encapsulation_ Review paper, used for researhc scholars
Agricultural_Statistics_at_a_Glance_2022_0.pdf
CIFDAQ's Market Insight: SEC Turns Pro Crypto
The Rise and Fall of 3GPP – Time for a Sabbatical?
Approach and Philosophy of On baking technology
Teaching material agriculture food technology
TokAI - TikTok AI Agent : The First AI Application That Analyzes 10,000+ Vira...
Detection-First SIEM: Rule Types, Dashboards, and Threat-Informed Strategy
Build a system with the filesystem maintained by OSTree @ COSCUP 2025
Advanced methodologies resolving dimensionality complications for autism neur...
Modernizing your data center with Dell and AMD
Machine learning based COVID-19 study performance prediction
How UI/UX Design Impacts User Retention in Mobile Apps.pdf
PA Analog/Digital System: The Backbone of Modern Surveillance and Communication
Electronic commerce courselecture one. Pdf
Digital-Transformation-Roadmap-for-Companies.pptx
Understanding_Digital_Forensics_Presentation.pptx
Diabetes mellitus diagnosis method based random forest with bat algorithm
Unlocking AI with Model Context Protocol (MCP)

Simulation in terminated system

  • 1. Output Analysis for a terminating simulators Presented By :Saleem Almaqashi 1
  • 2. Introduction – One realization (run) does not necessarily give the “correct” answer(s). – Variance exists in simulation results so we must be cautious about how we interpret results ◦ Output from our model {Y1, Y2, Y3, …} – {Y1, Y2, Y3, …} may not be independent; – {Y1, Y2, Y3, …} may have different distributions, depending on a number of different factors; – Estimators, confidence interval, and so on, must be constructed. 2
  • 3. Types of Simulations with Regard to Output Analysis Terminating Simulation Steady-state parameters Systems Steady-state cyclic parameters Non-terminating Dynamic parameters “Other parameters” Transient parameters 3
  • 4. Types of Simulations with Regard to Output Analysis  Terminating: Parameters to be estimated are defined relative to specific initial and stopping conditions that are part of the model  There is a “natural” and realistic way to model both the initial and stopping conditions  Output performance measures generally depend on both the initial and stopping conditions 4
  • 5. Terminating: Examples  Natural event “E” that specifies the length of each run.  Ex.1: Bank opens from 9 to 5, E = {8 hours of simulation (9-5)}  Ex.2: Military exercise Red vs. Blue, E = {Either Red or Blues wins}  Ex.3: Manufacturing 100 products (random process), E = {Completion of the 100th product}  Ex.4: Reliability simulation of a car (quality problems random), E = {First major quality problem occurs} 5
  • 6. Non terminating  Non terminating: There is no natural and realistic event that terminates the model Interested in “long- run” behavior characteristic of “normal” operation  If the performance measure of interest is a characteristic of a steady-state distribution of the process, it is a steady-state parameter of the model .  Theoretically, does not depend on initial conditions  Practically, must ensure that run is long enough so that initial-condition effects have dissipated 6
  • 7. Non terminating Examples  Ex. 1 (Cyclic): An inventory system, say a retail store, replenishments are cyclic (e.g., monthly orders and arrivals of goods), but demand is random. The performance measure can be average monthly inventory level.  Ex . 2 (Dynamic ) : Airport security system simulation (case study). Passenger volume varies by hour of day, day of the week. Performance measure – passenger waiting time (to get through security check point) is hourly.  Ex.3 (Transient ) : Transportation (case study). Multiple-lane highway has one lane blocked (e.g., accidents). Cars need to merge and traffic slows down. Performance measure: drive time during the traffic jam. 7
  • 8. Terminating vs. Steady state simulation 8
  • 9. Terminating Simulations  Statistics based on Observations ◦ Let Di = delay of ith customer in queue d = (the true value of) average delay in queue For m customer m m Di Estim ate Di i 1 i 1 D ( m) d lim (true mean) m m m ◦ In general xj = measured performance from the run = E[x] Confidence Interval (of n runs): 2 S 2 (n) x x (n) tn 1,1 /2 (Prisker used ) n I 9
  • 10. Terminating Simulations  Replication Approach ◦ Independent runs with different RN streams/seeds but same I.C.’s, also need same number of observations for each run (conflict with statistics based on time- persistent variables) ◦ Ex: Run model 10 times with identical initial conditions xj - 1.051 6.438 2.646 0.805 1.505 0.546 2.281 2.822 0.414 1.307 Each one is the average of 35 observations 35 D j x j D j (35) j 1 35 Compute: 1 10 (x j X )2 X (10) x j (35) 1.982 S 2 (10) 3.172 10 j 1 n 1 10
  • 11. Terminating Simulations  Replication Approach ◦ Ex: (Continue) From the statistics table: use = 0.10 (t9,0.95 = 1.833) So, confidence interval of delay times 3.172 1.982 1.833 1.982 1.032 10 0.950 d 3.014 witha 90% probabilit y ◦ Interpretation  90% chance (probability) the true value is between 0.950 and 3.014 (not “falls into”) or 90% that 0.950 to 3.014 covers the true value ◦ Better answer increased number of runs 11
  • 12. Terminating Simulations  Measure of Precision (Accuracy) ◦ Absolute vs. relative  Half width of actual C.I. absolute precision  Ratio of the half width to the magnitude of estimate relative precision of C.I. ◦ Determine how many runs are needed  Assumption: S2(n) is not changing (within each run)  Absolute Precision ( ) * S 2 (n) na ( ) min{i n : ti 1,1 /2 } i  Relative Precision ( ) S 2 ( n) ti 1,1 /2 * n( ) min{i n: i } r X ( n) 12
  • 13. Terminating Simulations  Measure of Precision (Accuracy) ◦ In the previous Ex:  Absolute precision ( ) = 1.032 If we want C.I. = 1.982 0.5 * 3.172 na (0.5) min{i 10 : ti 1,0.95 0.5} i * 2 i.e., na ( ) f ( S (n)) Continue to make additional runs i = 37 (27 more runs)  Relative precision ( ) = 1.032/1.982 = 0.521 (i.e., 90% of prob. value is within 52% of the true mean) If we want = 0.15 3.172 ti 1,0.95 * nr (0.15) min{i 10 : i 0.15} 1.982 Lead to i = 99 (89 more runs) 13
  • 14. Terminating Simulations  Sequential Procedure (to make multiple replications) 1. Select the initial replication n0 2 2. Compute (based on a selected ) S 2 (n) (n, ) tn 1,1 /2 n 3. Compute (n, ) ? is determined - relative precision X ( n) 4. If yes stop If not n = n + 1 (one additional run) and repeat steps 2, 3, and 4 14
  • 15. Terminating Simulations  Sequential Procedure ◦ In practice, need to obtain statistics at the end of each replication (run) Replicate 1: Estimate: x1, S12(x) clear stats - use new RN streams 2: Estimate: x2, S22(x)  n0 2: Estimate: xn0, Sno2(x) Compute X(n0), S2(n0)  Until  S 2 ( n) tn 1,1 /2 n: n X ( n) 15
  • 16. Conclusion  Statistical methods are used to analyze the results of simulation experiments.  Terminating: A simulation where there is a specific starting and stopping condition that is part of the model. 16
  • 17. 17