Distributed discrete-event simulation
ACM Computing Surveys (CSUR)
Flush primitives for asynchronous distributed systems
Information Processing Letters
Topics in distributed algorithms
Topics in distributed algorithms
Efficient algorithms for distributed snapshots and global virtual time approximation
Journal of Parallel and Distributed Computing - Special issue on parallel and discrete event simulation
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Detecting termination of distributed computations using markers
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Distributed simulation, algorithms and performance analysis (load balancing, distributed processing)
Distributed simulation, algorithms and performance analysis (load balancing, distributed processing)
A visual environment for distributed simulation systems
ACM SIGSIM Simulation Digest
| Hi-index | 0.00 |
In this paper we make an analogy between the time that storage must be maintained in an 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.