The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Event manipulation for discrete simulations requiring large numbers of events
Communications of the ACM
A comparison of heaps and the TL structure for the simulation event set
Communications of the ACM
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
An improved events list algorithm
WSC '77 Proceedings of the 9th conference on Winter simulation - Volume 2
Analysis of future event set algorithms for discrete event simulation
Communications of the ACM
The design of a multi-microprocessor based simulation computer - I
ANSS '82 Proceedings of the 15th annual symposium on Simulation
A heuristics-based approach to decreasing simulation model execution cost
ANSS '83 Proceedings of the 16th annual symposium on Simulation
The design of a multi-microprocessor based simulation computer - II
ANSS '83 Proceedings of the 16th annual symposium on Simulation
The simulation of a microprocessor based event set processor
ANSS '81 Proceedings of the 14th annual symposium on Simulation
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.02 |
Seven event set management algorithms and their associated data structure are presented informally and formally, their performances (time per “hold” operation, search length) are analyzed empirically, using appropriate statistical tests, and the relations between these algorithms are discussed. Each algorithm is tested for several different inter-arrival distributions and event set sizes. Five of these algorithms use data structures which apply successively more sophisticated indexing to a basic linked list, resulting in two algorithms with nearly constant assymptotic behavior. The other two, based on the “heap” data structure, has logarithmic behavior.