FELT: A Far Future Event List Structure Optimized for Calendar Queues

Abstract

Calendar queues (CQ) are often employed in discrete event simulators to store pending events. They can achieve O(1) access time as long as the CQ resizes often enough to ensure that events are not skewed but evenly distributed in the queue structure. However, a resize operation would involve creating a new CQ structure and then moving each item from the old CQ to the new CQ before discarding the old CQ. Hence, such resizes can be costly if the size of the queue is very large. This article proposes a new secondary queuing structure that complements the primary CQ structure. Known as FELT (far future event leaf tree), the secondary FELT structure is a lazy queue (i.e., semisorted) structure that manages events that are considered to be too far away to be considered in the primary CQ structure. The FELT structure is shown to be far superior than the dynamic lazy calendar queue.

Keywords

Calendar queue lazy queue pending event set data structures

Get full access to this article

View all access options for this article.

References

Brown, R. 1988. Calendar queues: A fast O(1) priority queue implementation for the simulation event set problem. Communications of the ACM 24 (12): 825-829.

Rönngren, R. , and R. Ayani . 1997. A comparative study of parallel and sequential priority queue algorithms. ACM Transactions of Modeling and Computer Simulation 7 (2): 157-209.

Oh, S. , and J. Ahn . 1999. Dynamic calendar queue. Proceedings of the 32nd Annual Simulation Symposium.

Tan, K. L. , and L.-J. Thng . 2000. SNOOPy calendar queue. Proceedings of the 2000 Winter Simulation Conference, pp. 487-495.

Oh, S. , and J. Ahn . 1997. Dynamic lazy calendar queue: An event list for network simulation. Proceedings of HPC Asia ’97, pp. 254-259.

Erickson, K. B. , R. E. Ladner , and A. LaMarca . 2000. Optimizing static calendar queues. ACM Transactions of Modeling and Computer Simulation 10 (3): 179-214.

Rönngren, R. , J. Riboe , and R. Ayani . 1993. Lazy queue: New approach to implementing the pending event set. International Journal of Computer Simulation 3:303-332.

Vaucher, J. G. , and P. Duval . 1975. A comparison of simulation event lists. Communications of the ACM 18 (4): 223-230.

Vaucher, J. G. , and P. Duval . 1977. On the distribution of event times for the notices in a simulation event list. INFOR 15 (2): 171-182.

10.

Steinman, J. S. 1994. Discrete-event simulation and the event horizon. Proceedings of the 8th Workshop on Parallel and Distributed Simulation (PADS’94), pp. 39-49.