ACM Transactions on Programming Languages and Systems (TOPLAS)
Planar point location using persistent search trees
Communications of the ACM
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Parallel discrete event simulation
Communications of the ACM - Special issue on simulation
More efficient bottom-up multi-pattern matching in trees
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
Selecting the checkpoint interval in time warp simulation
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
Shared variables in distributed simulation
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
In defense of discrete-event simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Eliminating amortization: on data structures with guaranteed response time
Eliminating amortization: on data structures with guaranteed response time
PORTS: a parallel, optimistic, real-time simulator
PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation
Parallel discrete event simulation: a modeling methodological perspective
PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation
Cost of state saving & rollback
PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation
Incremental state saving in SPEEDES using C++
WSC '93 Proceedings of the 25th conference on Winter simulation
An assessment of the ModSim/TWOS parallel simulation environment
WSC '91 Proceedings of the 23rd conference on Winter simulation
Maisie: A Language for the Design of Efficient Discrete-Event Simulations
IEEE Transactions on Software Engineering
Fully Persistent Arrays (Extended Array)
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Transparent incremental state saving in time warp parallel discrete event simulation
PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation
The APOSTLE simulation language: granularity control and performance data
PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation
Language based state saving extensions for optimistic parallel simulation
WSC '96 Proceedings of the 28th conference on Winter simulation
WSC '96 Proceedings of the 28th conference on Winter simulation
Multiplexed state saving for bounded rollback
Proceedings of the 29th conference on Winter simulation
State saving for interactive optimistic simulation
Proceedings of the eleventh workshop on Parallel and distributed simulation
Stack-free process-oriented simulation
Proceedings of the eleventh workshop on Parallel and distributed simulation
An Analytical Model for Hybrid Checkpointing in Time Warp Distributed Simulation
IEEE Transactions on Parallel and Distributed Systems
PADS '99 Proceedings of the thirteenth workshop on Parallel and distributed simulation
ICS '03 Proceedings of the 17th annual international conference on Supercomputing
SS '96 Proceedings of the 29th Annual Simulation Symposium (SS '96)
Nonblocking Checkpointing for Optimistic Parallel Simulation: Description and an Implementation
IEEE Transactions on Parallel and Distributed Systems
An overhead reducing technique for Time Warp
Journal of Parallel and Distributed Computing
A Version of MASM Portable Across Different UNIX Systems and Different Hardware Architectures
DS-RT '05 Proceedings of the 9th IEEE International Symposium on Distributed Simulation and Real-Time Applications
Incremental checkpointing with application to distributed discrete event simulation
Proceedings of the 38th conference on Winter simulation
Multiprogrammed non-blocking checkpoints in support of optimistic simulation on myrinet clusters
Journal of Systems Architecture: the EUROMICRO Journal
On constructing optimistic simulation algorithms for the discrete event system specification
ACM Transactions on Modeling and Computer Simulation (TOMACS)
| Hi-index | 0.00 |
Optimistic computation methods typically save copies of objects' state information, so that they can recover from erroneous “over-optimistic” computations. Such state saving is generally time and space consuming, and can be rather complicated both to implement and to use.I show how the data structure community's theory of persistence can be used not only to analyse and explain the treatment of state in optimistic systems, but also as a simple yet general mechanism for performing the necessary state saving with minimal impact on application code.Preliminary results based on a benchmark application and an existing optimistic simulator are presented, showing that providing support for fully general object states is a realistic and practical option. In addition, I show how some existing state saving techniques—including support for shared state—can be derived, and discuss a number of ways in which the model might be extended.