An introduction to simulation using GPSS/H
An introduction to simulation using GPSS/H
A comparison of simulation event list algorithms
Communications of the ACM
Exclusive simulation of activity in digital networks
Communications of the ACM
Time flow mechanisms for use in digital logic simulation
WSC '71 Proceedings of the 5th conference on Winter simulation
An empirical comparison of priority-queue and event-set implementations
Communications of the ACM
Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
Communications of the ACM
A comparative study of parallel and sequential priority queue algorithms
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Writing simulations from scratch: Pascal implementations
WSC '87 Proceedings of the 19th conference on Winter simulation
Analysis of future event set algorithms for discrete event simulation
Communications of the ACM
A detailed interactive simulation system for developing command and control systems
ANSS '83 Proceedings of the 16th annual symposium on Simulation
Event list management - a tutorial
WSC '83 Proceedings of the 15th conference on Winter Simulation - Volume 2
WSC '79 Proceedings of the 11th conference on Winter simulation - Volume 1
A taxonomy and analysis of event set management algorithms for discrete event simulation
ANSS '79 Proceedings of the 12th annual symposium on Simulation
WSC '81 Proceedings of the 13th conference on Winter simulation - Volume 1
Twol-amalgamated priority queues
Journal of Experimental Algorithmics (JEA)
A Complexity O(1) priority queue for event driven molecular dynamics simulations
Journal of Computational Physics
ICCOM'08 Proceedings of the 12th WSEAS international conference on Communications
A brief history of simulation revisited
Proceedings of the Winter Simulation Conference
| Hi-index | 0.05 |
One of the basic overhead activities necessary to carry out a discrete event simulation is the insertion and deletion of event notices (transactions) in/from the event list (future events chain). The insertion of event notices is of particular interest, because it requires a search of the event list to determine the point at which an event notice should be inserted. If a linear search is used, as is the case with most simulation languages, the time consumed by the search can grow as N2, where N is the average size of the event list. In a paper entitled “A Comparison of Event List Algorithms,” authors Jean G. Vaucher and Pierre Duval (1) evaluated three algorithms as alternatives to linear search. They concluded that an “...indexed list algorithm provides the best overall performance.” This paper describes a new algorithm, based on the indexed list algorithm of Vaucher and Duval. The algorithm is adaptive to the distribution of event interarrival times. Results are shown that indicate the algorithm works well with a number of distributions and that shortcomings of the indexed list algorithms are overcome.