Performance analysis of future event sets

ABSTRACT

The linked list and indexed list future event sets are investigated. The interaction hold model and the Jackson network model are the underlying stochastic models considered. For the interaction hold model and for the (doubly) linked list, we find, for example, the mean number of key comparisons performed in order to find a record's insertion point into the list; this is useful when deciding whether to scan from the head or the tail of the list. The distribution of the relative position of the to-be-inserted record is also obtained; for indexed lists, this is helpful when deciding the number of sublists and position(s) of the middle pointer(s). The Jackson network model has a realistic event logic, but events are restricted to be exponentially distributed. Because the stationary probabilities can be computed for this model, it is then possible to evaluate and compare the (steady-state) performance of certain future event sets (e.g. linked lists scanned from the head or the tail).

REFERENCES

• 1: Barlow, I~ E. and Proschan, F. (1975). Statistical Theory of Reliability and Life Testing: P~vbability Models. Holt, Rinehart and Winston, New York.
• 2: Damerdji, H. and Glynn, P. W. (1995). Limit theory for performance modeling of hlture event set algorithms. In preparation.
• 3: Davey, D. and Vaucher, J. (1980). Self-optimizing partitioned sequencing sets for discrete event simulations. INFOR, 18, 41-61.
• 4: Devroye, L. (1986). Nonuniform Random Variate Generation. Springer-Verlag, New York.
• 5: Engelbrecht-Wiggans, 1-~ and Maxwell, W. L. (1978). Analysis of the time indexed list procedure for synchronization of discrete event simulations. Management Science, 24, 1417-1427.
• 6: Douglas W. Jones, An empirical comparison of priority-queue and event-set implementations, Communications of the ACM, v.29 n.4, p.300-311, April 1986 [doi>10.1145/5684.5686]
• 7: William M. McCormack , Robert G. Sargent, Analysis of future event set algorithms for discrete event simulation, Communications of the ACM, v.24 n.12, p.801-812, Dec. 1981 [doi>10.1145/358800.358803]
• 8: Meyn, S. P. and Tweedie, ~ L. (1993). Markov Chains and Stochastic Stability. Springer-Verlag, London.
• 9: Vaucher, J. G. (1977). On the distribution of event times for the notices in a simulation event list. IN- FOR, 15~ 171-182.

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.6 SIMULATION AND MODELING
      I.6.1 Simulation Theory
          Subjects: Model classification

Additional Classification:
  D. Software
  D.4 OPERATING SYSTEMS

  E. Data
  E.1 DATA STRUCTURES
      Subjects: Arrays; Lists, stacks, and queues

  I. Computing Methodologies
  I.6 SIMULATION AND MODELING
      I.6.7 Simulation Support Systems
          Subjects: Environments

General Terms:
Performance, Theory, Verification