Ladder queue: an O(1) priority queue structure for large-scale discrete event simulation

DOI10.1145/1103323.1103324zbMATH Open1390.90260OpenAlexW2028075868MaRDI QIDQ4565356FDOQ4565356

Authors: Wai Teng Tang, Rick Siow Mong Goh, Ian Li-Jin Thng 

Publication date: 12 June 2018

Published in: ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1103323.1103324

Recommendations

• Optimizing static calendar queues
• Twol-amalgamated priority queues
• A complexity O(1) priority queue for event driven molecular dynamics simulations
• P-tree structures and event horizon: efficient event-set implementations
• The amortized complexity of Henriksen's algorithm

zbMATH Keywords

priority queuecalendar queuepending event set implementations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Queues and service in operations research (90B22)

Cited In (7)

• Managing pending events in sequential and parallel simulations using three-tier heap and two-tier ladder queue
• Toward unified hybrid simulation techniques for spiking neural networks
• Event-driven molecular dynamics simulation of hard-sphere gas flows in microchannels
• A complexity O(1) priority queue for event driven molecular dynamics simulations
• P-tree structures and event horizon: efficient event-set implementations
• Twol-amalgamated priority queues
• Revisiting priority queues for image analysis

This page was built for publication: Ladder queue: an \(O(1)\) priority queue structure for large-scale discrete event simulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4565356)