Preprint from ACM/IEEE/SCS 8th Workshop on Parallel and Distributed Simulation (PADS), 1994 The Pessimism behind Optimistic Simulation
Download:
|
|
by George Varghese, Roger Chamberlain, William E. Weihl
http://www-cse.ucsd.edu/users/varghese/PAPERS/pads94.ps.Z
Add To MetaCart
Abstract:
In this paper we make an analogy between the time that storage must be maintained in a optimistic simulation and the blocking time in a conservative simulation. By exploring this analogy, we design two new Global Virtual Time (GVT) protocols for Time Warp systems. The first protocol is based on null message clock advancement in conservative approaches. Our main contribution is a new protocol inspired by Misra's circulating marker scheme for deadlock recovery. It is simple enough to be implemented in hardware, takes no overhead in the normal path, can be made to work over non-FIFO links, and its overhead can be dynamically tuned based on computational load.
Citations
| 796 | Distributed snapshots: Determining global states of distributed systems – Chandy, Lamport - 1985 |
| 230 | Introduction to Distributed Algorithms – Tel - 1994 |
| 192 | Distributed Discrete-Event Simulation – Misra - 1985 |
| 91 | Efficient algorithms for distributed snapshots and global virtual time approximation – Mattern - 1993 |
| 40 | Detecting Termination of Distributed Computations using Markers – Misra - 1983 |
| 39 | Distributed simulation, algorithms and performance analysis – Samadi - 1985 |
| 22 | Flush primitives for asynchronous distributed systems – Ahuja - 1990 |
| 12 | Global Virtual Time Approximation with Distributed Termination Detection Algorithms – Mattern, Mehl, et al. - 1991 |
