Please use this identifier to cite or link to this item:
|Title:||FELT: A far future event list structure optimized for calendar queues||Authors:||Hui, T.C.-K.
Pending event set
|Issue Date:||Jun-2002||Citation:||Hui, T.C.-K., Thng, I.L.-J. (2002-06). FELT: A far future event list structure optimized for calendar queues. Simulation 78 (6) : 343-361. ScholarBank@NUS Repository. https://doi.org/10.1177/0037549702078006573||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 queueing 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.||Source Title:||Simulation||URI:||http://scholarbank.nus.edu.sg/handle/10635/56044||ISSN:||00375497||DOI:||10.1177/0037549702078006573|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Aug 19, 2019
WEB OF SCIENCETM
checked on Jul 9, 2019
checked on Aug 18, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.