Self-adjusting binary search trees
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
An empirical comparison of priority-queue and event-set implementations
Communications of the ACM
Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
Communications of the ACM
Cooperative acceleration: robust conservative distributed discrete event simulation
PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation
Analysis of future event set algorithms for discrete event simulation
Communications of the ACM
A comparison of simulation event list algorithms
Communications of the ACM
Parallel and Distribution Simulation Systems
Parallel and Distribution Simulation Systems
SIMULATION OF PACKET COMMUNICATION ARCHITECTURE COMPUTER SYSTEMS
SIMULATION OF PACKET COMMUNICATION ARCHITECTURE COMPUTER SYSTEMS
Sequential Performance of Asynchronous Conservative PDES Algorithms
Proceedings of the 19th Workshop on Principles of Advanced and Distributed Simulation
A discrete-event simulation tool for the analysis of simultaneous events
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
| Hi-index | 0.00 |
Sequential discrete event simulation is widely employed to study the behavior of many systems. Events are typically managed in a central event list which is implemented as a priority queue ordered by event timestamps. Most research to improve sequential simulation performance has focused on improving the priority queue implementations. Recent work has demonstrated that asynchronous conservative parallel discrete event simulation systems can achieve better sequential performance under some conditions, but worse performance under other conditions. This paper introduces a new sequential discrete event simulation algorithm that can exhibit some of the same performance advantages of asynchronous conservative parallel discrete event simulation algorithms and has complexity no more than that of central event list algorithms in the worst case.