Design and Evaluation of the Rollback Chip: Special Purpose Hardware for Time Warp
IEEE Transactions on Computers
Effects of the checkpoint interval on time and space in time warp
ACM Transactions on Modeling and Computer Simulation (TOMACS)
The treatment of state in optimistic systems
PADS '95 Proceedings of the ninth workshop on Parallel and distributed simulation
Comparative analysis of periodic state saving techniques in time warp simulators
PADS '95 Proceedings of the ninth workshop on Parallel and distributed simulation
Transparent incremental state saving in time warp parallel discrete event simulation
PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation
Automatic incremental state saving
PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation
State saving for interactive optimistic simulation
Proceedings of the eleventh workshop on Parallel and distributed simulation
Event history based sparse state saving in time warp
PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
A Cost Model for Selecting Checkpoint Positions in Time Warp Parallel Simulation
IEEE Transactions on Parallel and Distributed Systems
Nonblocking Checkpointing for Optimistic Parallel Simulation: Description and an Implementation
IEEE Transactions on Parallel and Distributed Systems
Distributed Simulation: A Case Study in Design and Verification of Distributed Programs
IEEE Transactions on Software Engineering
Efficiently unifying parallel simulation techniques
Proceedings of the 44th annual Southeast regional conference
| Hi-index | 0.00 |
In this paper, we introduce a technique to reduce the number of state savings and the event queue size of Time Warp. By reducing the state saving and the sizes of event queues, we can decrease the overhead and the maximum memory requirement in Time Warp. We exploit the look-ahead technique to get a lower bound time stamp of the next event and to determine if an event is safe to be executed. No State saving is carried out when the event execution is safe. This lower bound can be used to discard saved states even though the time stamps are greater than the global virtual time (GVT). We prove that the proposed technique is correct under both aggressive and lazy cancellation schemes. This technique can be implemented with minimal additional overhead. Benchmark results on logic simulation show that the mechanism can reduce the number of state savings and memory size requirements significantly.