ACM Transactions on Programming Languages and Systems (TOPLAS)
Concerning the size of logical clocks in distributed systems
Information Processing Letters
An efficient implementation of vector clocks
Information Processing Letters
Wolf: a rollback algorithm for optimistic distributed simulation systems
WSC '88 Proceedings of the 20th conference on Winter simulation
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Causality representation and cancellation mechanism in time warp simulations
Proceedings of the fifteenth workshop on Parallel and distributed simulation
Parallel and Distribution Simulation Systems
Parallel and Distribution Simulation Systems
Detecting causal relationships in distributed computations: in search of the holy grail
Distributed Computing
Proceedings of the 21st International Workshop on Principles of Advanced and Distributed Simulation
Throttled lazy cancellation in time warp simulation
MOAS'07 Proceedings of the 18th conference on Proceedings of the 18th IASTED International Conference: modelling and simulation
On constructing optimistic simulation algorithms for the discrete event system specification
ACM Transactions on Modeling and Computer Simulation (TOMACS)
PADS '09 Proceedings of the 2009 ACM/IEEE/SCS 23rd Workshop on Principles of Advanced and Distributed Simulation
Scalable Time Warp on Blue Gene Supercomputers
PADS '09 Proceedings of the 2009 ACM/IEEE/SCS 23rd Workshop on Principles of Advanced and Distributed Simulation
Throttled lazy cancellation in time warp simulation
MS '07 The 18th IASTED International Conference on Modelling and Simulation
Scalable RF propagation modeling on the IBM Blue Gene/L and Cray XT5 supercomputers
Winter Simulation Conference
| Hi-index | 0.00 |
An efficient cancellation scheme is essential to the performance of Time Warp simulations. The pitfalls of rollback echoes, chasing hazards and cascading rollbacks can be identified as being attributable to the inefficiency of the conventional per-event based cancellation scheme. Instead of capturing the happen-before relation between events, which is used by the range based cancellation scheme, the batch based cancellation scheme proposed in this paper utilizes a modified paradigm of vector time, namely, state vector, to capture the dependence of events. We prove that with conformance to specific rules regulating the advancement of LPs, the events to be cancelled by a straggler message can be determined using a range of the state vector. Thus, knowledge of the range enables any LP to recover from the receipt of a straggler message at the cost of at most one rollback (i.e., rollback optimal). The results of preliminary experiments conducted using a manufacturing model show that the proposed scheme is successful in reducing the number of anti-messages and increasing the ratio of the number of committed events to the number of processed events.