ACM Transactions on Programming Languages and Systems (TOPLAS)
A formal approach to undo operations in programming languages
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Optimal memory management for time warp parallel simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on parallel and distributed systems performance
Selecting the checkpoint interval in time warp simulation
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
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
Algorithm 755: ADOL-C: a package for the automatic differentiation of algorithms written in C/C++
ACM Transactions on Mathematical Software (TOMS)
A random number generator based on the combination of four LCGs
Mathematics and Computers in Simulation - Special issue: papers presented at the MSSA/IMACS 11th biennial conference on modelling and simulation
PADS '99 Proceedings of the thirteenth workshop on Parallel and distributed simulation
ACM SIGPLAN Notices
Efficient optimistic parallel simulations using reverse computation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Large-Scale TCP Models Using Optimistic Parallel Simulation
Proceedings of the seventeenth workshop on Parallel and distributed simulation
Proceedings of the seventeenth workshop on Parallel and distributed simulation
Optimizing incremental state-saving and restoration
Optimizing incremental state-saving and restoration
Reversibility for efficient computing
Reversibility for efficient computing
Large-scale network simulation techniques: examples of TCP and OSPF models
ACM SIGCOMM Computer Communication Review
Event reconstruction in time warp
Proceedings of the eighteenth workshop on Parallel and distributed simulation
Batch based cancellation: a rollback optimal cancellation scheme in time warp simulations
Proceedings of the eighteenth workshop on Parallel and distributed simulation
µsik " A Micro-Kernel for Parallel/Distributed Simulation Systems
Proceedings of the 19th Workshop on Principles of Advanced and Distributed Simulation
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
A Case Study in Understanding OSPF and BGP Interactions Using Efficient Experiment Design
Proceedings of the 20th Workshop on Principles of Advanced and Distributed Simulation
Eliminating remote message passing in optimistic simulation
Proceedings of the 38th conference on Winter simulation
Optimistic parallel discrete event simulation of the event-based transmission line matrix method
Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come
Proceedings of the 22nd 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
Proceedings of the Winter Simulation Conference
| Hi-index | 0.00 |
The traditional rollback mechanism deployed in optimistic simulation is state-saving. More recently, the method of reverse computation has been proposed to reduce the amount of memory consumed by state-saving. This method computes the reverse code for the model during rollback execution, rather than recalling saved state memory. In practice, this method has been shown to offer memory-efficiency without sacrificing computational efficiency. In order to support reverse codes in the model, events must continue to be preserved in the system until fossil collection can be performed. In this paper we define a new algorithm to support perfectly reversible model computation that does not depend on storing the full processed event history. This approach improves memory consumption, further supporting large-scale simulation.