An efficient data structure for the simulation event set
Communications of the ACM
Heaps applied to event driven mechanisms
Communications of the ACM
A comparison of simulation event list algorithms
Communications of the ACM
Improved event-scanning mechanisms for discrete event simulation
Communications of the ACM
Simulation Using GPSS
Event list management - a tutorial
WSC '83 Proceedings of the 15th conference on Winter Simulation - Volume 2
The simulation of a pipelined event set processor
WSC '81 Proceedings of the 13th conference on Winter simulation - Volume 2
The design of a multi-microprocessor based simulation computer - III
ANSS '84 Proceedings of the 17th annual symposium on Simulation
Hi-index | 0.01 |
The traditional mechanism for maintaining a list of pending events in a discrete event simulation is the simple linked list. However, in large scale simulations this list often becomes cumbersome to maintain since the number of pending events may become quite large. As a result, the execution time required by the simple linked list is often a significant portion of total simulation time. Several articles have been published suggesting improved synchronization procedures. The most efficient procedures reported are the time indexed procedure and the two level procedure. Both methodologies are designed for use in languages such as PASCAL or Pl/l, and as a result neither algorithm translates well into FORTRAN. Further, both procedures require external parameter definition, which is a major handicap to their adoption by a general purpose language. This paper introduces a new synchronization procedure, the two list procedure, which is much faster than simple linked lists for large pending event files. This procedure was designed for implementation in FORTRAN, and properly implemented it is transparent to the user; thus it is ideal for adoption by general purpose simulation languages.