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
2 Citations
Exploiting Adaptive Ladder Queue into Repast Simulation platform
  • A. Furfaro, L. Sacco
  • Computer Science
  • 2018 IEEE/ACM 22nd International Symposium on Distributed Simulation and Real Time Applications (DS-RT)
  • 2018
Analyzing Simulation Model Profile Data to Assist Synthetic Model Generation

References

SHOWING 1-2 OF 2 REFERENCES
Ladder queue: An O(1) priority queue structure for large-scale discrete event simulation
  • 44
  • Highly Influential
  • PDF
Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
  • 455
  • Highly Influential
  • PDF