Lazy Queue: an efficient implementation of the pending-event set
Lazy Queue: an efficient implementation of the pending-event set
复制标题
惰性队列：待处理事件集的高效实现
DOI：
10.1109/simsym.1991.151506
复制
发表时间：
1991
期刊：
影响因子：
--
通讯作者：
R. Ayani
中科院分区：
文献类型：
--
作者：
R. Rönngren;J. Riboe;R. Ayani
本文提出了一种新的优先级队列实现——延迟队列。它专门用于处理离散事件模拟中遇到的挂起事件集。Lazy Queue是一种多列表的变体，其中排序过程被延迟到元素要退出队列的时间点附近。已经测量了队列访问时间，并将其与隐式堆和日历队列的访问时间进行了比较。实验结果表明，延迟队列优于这些优先级队列实现
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.<<ETX>>