Self-adjusting binary search trees
Journal of the ACM (JACM)
SIAM Journal on Computing
Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
Communications of the ACM
A data structure for manipulating priority queues
Communications of the ACM
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
Scalable architectures for integrated traffic shaping and link scheduling in high-speed ATM switches
IEEE Journal on Selected Areas in Communications
Twol-amalgamated priority queues
Journal of Experimental Algorithmics (JEA)
Queue-based method for efficient simulation of biological self-assembly systems
Journal of Computational Physics
Ladder queue: An O(1) priority queue structure for large-scale discrete event simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
GarQ: An efficient scheduling data structure for advance reservations of grid resources
International Journal of Parallel, Emergent and Distributed Systems
| Hi-index | 0.00 |
The calendar queue is an important implementation of a priority queue that is particularly useful in discrete event simulators. We investigate the performance of the static calendar queue that maintains N active events. The main contribution of this article is to prove that, under reasonable assumptions and with the proper parameter settings, the calendar queue data structure will have constant (independent of N) expected time per event processed. A simple formula is derived to approximate the expected time per event. The formula can be used to set the parameters of the calendar queue to achieve optimal or near optimal performance. In addition, a technique is given to calibrate a specific calendar queue implementation so that the formula can be applied in a practical setting.