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
The process view of simulation (Operating and programming systems series)
The process view of simulation (Operating and programming systems series)
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
Analysis of future event set algorithms for discrete event simulation
Communications of the ACM
Event list management - a tutorial
WSC '83 Proceedings of the 15th conference on Winter Simulation - Volume 2
A taxonomy and analysis of event set management algorithms for discrete event simulation
ANSS '79 Proceedings of the 12th annual symposium on Simulation
An empirical comparison of advanced event file synchronization structures
WSC '82 Proceedings of the 14th conference on Winter Simulation - Volume 1
P-tree structures and event horizon: efficient event-set implementations
WSC '05 Proceedings of the 37th conference on Winter simulation
| Hi-index | 48.28 |
Following publication of our paper [2], questions arose with respect to the superiority of the TL structure over heaps,1 particularly in the face of the remarks of Gonnet [3], concerning the use of heaps for the physical realization of the simulation event set. Gonnet's communication was in response to the Vaucher and Duval paper [5], and suggested the heap to be a more efficient structure than any proposed in [5]. As regards a comparison of heaps and the TL structure we can make the following remarks: