Proceedings of the 32nd conference on Winter simulation
Proceedings of the 35th conference on Winter simulation: driving innovation
Twol-amalgamated priority queues
Journal of Experimental Algorithmics (JEA)
Short note: O(N) implementation of the fast marching algorithm
Journal of Computational Physics
NS-2 TCP-Linux: an NS-2 TCP implementation with congestion control algorithms from Linux
WNS2 '06 Proceeding from the 2006 workshop on ns-2: the IP network simulator
The event queue problem and PDevs
SpringSim '07 Proceedings of the 2007 spring simulation multiconference - Volume 2
JSimPlus: a tool for teaching simulation techniques
Proceedings of the 14th Communications and Networking Symposium
A model reduction approach for improving discrete event simulation performance
Proceedings of the 6th International ICST Conference on Simulation Tools and Techniques
| Hi-index | 0.00 |
Discrete event simulations need a priority queue sorting events according to their timestamp to process events in their time order. As the number of events increases, the choice of a data structure for this event list can affect the simulation performance significantly. A calendar queue is one of data structures popularly used in most discrete event simulators due to its O(1) time complexity regardless of the number of stored events. Calendar queues, however, perform poorly over skewed event distributions due to the static resize algorithm and the inappropriate selection of events for measuring the degree of the event distribution. To improve the calendar queue's performance over uneven event distributions, this paper proposes two new mechanisms. We call our calendar queue adopting these two mechanisms DCQ (Dynamic Calendar Queue). Our experiment results showed that DCQ can achieve an order of magnitude speed-up for uneven distributions while performing as well over even distributions as the conventional calendar queue.