Lazy Queue: an efficient implementation of the pending-event set

Abstract

A new priority queue implementation, the Lazy Queue, is presented in this paper. It is tailored to handle the pending event set encountered in discrete event simulation. The Lazy Queue is a multi-list variety where the sorting process is delayed until a point near the time where the elements are to be dequeued. The queue access time has been measured and compared with the access times of an implicit heap and a calendar queue. The experimental results indicate that the Lazy Queue is superior to these priority queue implementations.<>