ACM Transactions on Programming Languages and Systems (TOPLAS)
An execution model for distributed object-oriented computation
OOPSLA '88 Conference proceedings on Object-oriented programming systems, languages and applications
Parallel execution of sequential scheme with ParaTran
LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Virtual time II: storage management in conservative and optimistic systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
PADS '95 Proceedings of the ninth workshop on Parallel and distributed simulation
Formal semantics for expressing optimism: the meaning of HOPE
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
How to integrate shared variables in distributed simulation
ACM SIGSIM Simulation Digest
Trade-Off between Sequential and Time Warp-Based Parallel Simulation
IEEE Transactions on Parallel and Distributed Systems
A Formal Specification and Verification Framework for Time Warp-Based Parallel Simulation
IEEE Transactions on Software Engineering
On consistency and network latency in distributed interactive applications: a survey--part I
Presence: Teleoperators and Virtual Environments
Bias in parallel and distributed simulation systems
WSC '05 Proceedings of the 37th conference on Winter simulation
On constructing optimistic simulation algorithms for the discrete event system specification
ACM Transactions on Modeling and Computer Simulation (TOMACS)
| Hi-index | 0.00 |
We develop a simple formal model of the Time Warp approach to distributed computation, prove several important properties of the model, and devise some extensions to Time Warp that provide improved termination behavior. Our model consists of processes that communicate solely via message passing. One of the basic process steps is a rollback operation that includes message retraction via transmission of antimessages. In the model, we consider three problems: safety, progress, and termination. By safety, we mean that for a given system of processes, if a run of the system terminates, then the final system state of the run is identical to the final system state of a rollback-free run. We give premises that imply safety, and a counterexample that shows how safety can fail. By progress, we mean that, as a run of a system proceeds, the minimum timestamp of an unprocessed message always eventually increases. We state three axioms that imply the progress property. By termination, we mean that, if all rollback-free runs of a system terminate, then all runs terminate. The termination property is generally false in existing implementations of Time Warp systems due to the possibility of Time Warp vortices. We define additional mechanisms that can guarantee the termination property for most Time Warp applications.