ACM Transactions on Programming Languages and Systems (TOPLAS)
A study of time warp rollback mechanisms
ACM Transactions on Modeling and Computer Simulation (TOMACS)
ANSS '91 Proceedings of the 24th annual symposium on Simulation
PADS '95 Proceedings of the ninth workshop on Parallel and distributed simulation
Conservative circuit simulation on shared-memory multiprocessors
PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation
Estimating the cost of throttled execution in time warp
PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation
An empirical study of conservative scheduling
PADS '00 Proceedings of the fourteenth workshop on Parallel and distributed simulation
Performance Evaluation of Conservative Algorithms in Parallel Simulation Languages
IEEE Transactions on Parallel and Distributed Systems
Lookback: a new way of exploiting parallelism in discrete event simulation
Proceedings of the sixteenth workshop on Parallel and distributed simulation
| Hi-index | 0.00 |
Simulations running under Time Warp using lazy cancellation can beat the bound given by the critical path. We explain this phenomenon to be the result of a kind of intra-object parallelism. Specifically, we show that instances of beating the critical path, called supercritical speedup, are made possible by messages that are independent of some event which precedes the message. This insight leads to a new definition for the critical path which is a tighter lower bound on Time-Warp simulations using lazy cancellation than any previously proposed. These results suggest criteria for choosing between lazy and aggressive cancellation.