ACM Transactions on Programming Languages and Systems (TOPLAS)
Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
Communications of the ACM
Efficient implementation of event sets in Time Warp
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
Efficient and scalable PRAM algorithms for discrete-event simulation of bounded degree networks
Journal of Parallel and Distributed Computing - Special issue on parallel and discrete event simulation
Discrete-event simulation and the event horizon part 2: event list management
PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation
PADS '00 Proceedings of the fourteenth workshop on Parallel and distributed simulation
Proceedings of the 35th conference on Winter simulation: driving innovation
Eliminating remote message passing in optimistic simulation
Proceedings of the 38th conference on Winter simulation
| Hi-index | 0.00 |
Compared to highly optimized optimistic simulators which use local event queues for individual processors on a shared-memory computer, we demonstrate that employing a single global event queue drastically reduces the number of rollbacks, brings down the storage requirements, and achieves superior load balance. On a bus-based Silicon Graphics multiprocessor, these virtues consistently translated into faster execution times and higher speedups on those synthetic networks of medium- to coarse-grained logical processes which were ridden with rollbacks and load imbalance on local-queue-based simulators. A dynamic randomization-based load distribution scheme for local-event-queue simulators is also shown to be an effective improvement.