ACM Transactions on Programming Languages and Systems (TOPLAS)
Time warp on a shared memory multiprocessor
Transactions of the Society for Computer Simulation International
GTW: a time warp system for shared memory multiprocessors
WSC '94 Proceedings of the 26th conference on Winter simulation
Clustered time warp and logic simulation
PADS '95 Proceedings of the ninth workshop on Parallel and distributed simulation
Breadth-first rollback in spatially explicit simulations
Proceedings of the eleventh workshop on Parallel and distributed simulation
Parallel simulation: parallel and distributed simulation systems
Proceedings of the 33nd conference on Winter simulation
Parallel discrete-event simulation applications
Journal of Parallel and Distributed Computing - Parallel and Distributed Discrete Event Simulation--An Emerging Technology
Time warp - connection oriented
Proceedings of the eighteenth workshop on Parallel and distributed simulation
Parallel simulation: distributed simulation systems
Proceedings of the 35th conference on Winter simulation: driving innovation
Using Consistent Global Checkpoints to Synchronize Processes in Distributed Simulation
DS-RT '05 Proceedings of the 9th IEEE International Symposium on Distributed Simulation and Real-Time Applications
Throttled lazy cancellation in time warp simulation
MOAS'07 Proceedings of the 18th conference on Proceedings of the 18th IASTED International Conference: modelling and simulation
Throttled lazy cancellation in time warp simulation
MS '07 The 18th IASTED International Conference on Modelling and Simulation
A New Algorithm for VHDL Parallel Simulation
ACM Transactions on Design Automation of Electronic Systems (TODAES)
| Hi-index | 0.00 |
Time Warp is known for its ability to maximize the exploitation of the parallelism inherent in a simulation. However, this potential has been undermined by the cost of processing causality violations. Minimizing this cost has been one of the most challenging issues facing Time Warp.In this paper, we present dependence list cancellation, a direct cancellation technique for Time Warp which is intended for use in a distributed memory environment such as a network of workstations. This approach provides for the swift cancellation of erroneous events, thereby preventing the propagation of their (erroneous) descendants. The dependence list also provides an event filtering function which detects erroneous future events, and also reduces the number of anti-messages used in the simulation. Our experimental work indicates that dependence list cancellation results in a dramatic reduction in the time required to process causality violations in Time Warp.