• DOI:10.1145/3200921.3200925
Corpus ID: 21699926

Adaptive Ladder Queue: Achieving O(1) Amortized Access Time in Practice

@article{Furfaro2018AdaptiveLQ,
  title={Adaptive Ladder Queue: Achieving O(1) Amortized Access Time in Practice},
  author={A. Furfaro and L. Sacco},
  journal={Proceedings of the 2018 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation},
  year={2018}
}

• A. Furfaro, L. Sacco
• Published 2018
• Computer Science
• Proceedings of the 2018 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation

The data structure that handles the pending event set of a discrete event simulator is a critical component in that its performances have a direct impact on those of the overall simulation engine. Many data structures have been proposed in the literature. Among them, the Ladder Queue (LadderQ) claims $O(1)$ amortized access time. However, empirical results show that the practical achievement of such performances is highly dependent on the distribution of event timestamps and that in many cases… Expand

View on ACM

doi.org

Save to Library

Create Alert

Cite

Launch Research Feed