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
Program inversion: more than fun!
Science of Computer Programming
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
Efficient algorithms for distributed snapshots and global virtual time approximation
Journal of Parallel and Distributed Computing - Special issue on parallel and discrete event simulation
History cache: hardware support for reverse execution
ACM SIGARCH Computer Architecture News
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
Formal verification and empirical analysis of rollback relaxation
Journal of Systems Architecture: the EUROMICRO Journal - Special double issue: parallel and distributed simulation
ACM SIGPLAN Notices
Efficient optimistic parallel simulations using reverse computation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Lookback: a new way of exploiting parallelism in discrete event simulation
Proceedings of the sixteenth workshop on Parallel and distributed simulation
NREVERSAL of Fortune - The Thermodynamics of Garbage Collection
IWMM '92 Proceedings of the International Workshop on Memory Management
Large-Scale TCP Models Using Optimistic Parallel Simulation
Proceedings of the seventeenth workshop on Parallel and distributed simulation
Using Reversible Computing To Achieve Fail-Safety
ISSRE '97 Proceedings of the Eighth International Symposium on Software Reliability Engineering
Optimizing incremental state-saving and restoration
Optimizing incremental state-saving and restoration
Reversibility for efficient computing
Reversibility for efficient computing
Revisiting an automatic program inverter for Lisp
ACM SIGPLAN Notices
Proceedings of the Winter Simulation Conference
Hi-index | 0.00 |
Typically, large-scale optimistic parallel simulations will spend 90% or more of the total execution time forward processing events and very little time executing rollbacks. In fact, it was recently shown that a large-scale TCP model consisting of over 1 million nodes will execute without generating any rollbacks (i.e., perfect optimistic execution is achieved). The major cost involved in forward execution is the preparation for a rollback in the form of state-saving. Using a technique called reverse computation, state-saving overheads can be greatly reduced. Here, the rollback operation is realized by executing previously processed events in reverse. However, events are retained until GVT sweeps past. In this paper, we define a new algorithm for realizing a continuum of reverse computation-based parallel simulation systems, which enables us to relax the computing of GVT and potentially further reduces the amount of memory required to execute an optimistic simulation.