The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Event manipulation for discrete simulations requiring large numbers of events
Communications of the ACM
An efficient data structure for the simulation event set
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
| Hi-index | 0.00 |
Simulation models for large systems have earned the reputation of eating up hours of computer time. This problem can be attributed in part to the fact that a significant amount of bookkeeping time is required to keep future events in their proper sequence. Many methods have been proposed to improve the efficiency of this operation but few results have been published to indicate how they perform in a real simulation environment. This paper shows how simulation time, using a particular simulation language (GASP IV), can be substantially reduced by replacing the existing filing system with a slightly modified version of a recently proposed event scheduling algorithm called the TL algorithm. Guidelines are given for the selection of the parameters of the algorithm, and also some experimental comparisons between the current GASP IV filing system and the new TL/GASP implementation.