ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallel discrete event simulation
Communications of the ACM - Special issue on simulation
Design and Evaluation of the Rollback Chip: Special Purpose Hardware for Time Warp
IEEE Transactions on Computers
Selecting the checkpoint interval in time warp simulation
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
An analytical comparison of periodic checkpointing and incremental state saving
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
Adaptive checkpointing in Time Warp
PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation
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
Event sensitive state saving in time warp parallel discrete event simulations
WSC '96 Proceedings of the 28th conference on Winter simulation
Incremental state saving in SPEEDES using C++
WSC '93 Proceedings of the 25th conference on Winter simulation
An external state management system for optimistic parallel simulation
WSC '93 Proceedings of the 25th conference on Winter 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
Adaptive checkpoint intervals in an optimistically synchronised parallel digital system simulator
VLSI '93 Proceedings of the IFIP TC10/WG 10.5 International Conference on Very Large Scale Integration
Grain sensitive event scheduling in time warp parallel discrete event simulation
PADS '00 Proceedings of the fourteenth workshop on Parallel and distributed simulation
Semi-asynchronous checkpointing for optimistic simulation on a Myrinet based NOW
Proceedings of the fifteenth 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
Proceedings of the 21st International Workshop on Principles of Advanced and Distributed Simulation
Scalable Time Warp on Blue Gene Supercomputers
PADS '09 Proceedings of the 2009 ACM/IEEE/SCS 23rd Workshop on Principles of Advanced and Distributed Simulation
Scalable RF propagation modeling on the IBM Blue Gene/L and Cray XT5 supercomputers
Winter Simulation Conference
| Hi-index | 0.00 |
In this paper we present a software approach, namely Fast-Software-Checkpointing (FSC), to reduce the running time of the state saving protocol in optimistic parallel discrete event simulation. The idea behind FSC is to use the instructions performed during the execution of an event as part of the state saving protocol, hence the total number of instructions due to state saving is reduced. Under FSC the time for saving the state of a logical process prior to the execution of an event e requires an amount of time proportional to the amount of state variables not updated by e's execution, as only these variables must be copied. This outlines that FSC shows some dualism with respect to incremental state saving. We show, however, that there exists a basic difference between the two solutions as in FSC some of the state saving instructions are actually event routine instructions, while in incremental state saving they are only added and mixed to the latter ones. We also present a simple software architecture to support FSC and simulation results to demonstrate the effectiveness of such solution. The obtained data show that FSC, combined with a sparse state saving strategy, may represent the best checkpointing solution in case of both medium/small state granularity simulations and large state granularity simulations even with small (but non-minimal) portions of the state updated by event execution. FSC may result therefore suited for a wide class of simulation problems.