ACM Transactions on Programming Languages and Systems (TOPLAS)
The causal ordering abstraction and a simple way to implement it
Information Processing Letters
Efficient algorithms for distributed snapshots and global virtual time approximation
Journal of Parallel and Distributed Computing - Special issue on parallel and discrete event simulation
An adaptive causal ordering algorithm suited to mobile computing environments
Journal of Parallel and Distributed Computing
On event ordering in parallel discrete event simulation
PADS '99 Proceedings of the thirteenth workshop on Parallel and distributed 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
A New Algorithm to Implement Causal Ordering
Proceedings of the 3rd International Workshop on Distributed Algorithms
The Dark Side of Risk (What your mother never told you about Time Warp)
The Dark Side of Risk (What your mother never told you about Time Warp)
Optimizing Parallel Applications for Wide-Area Clusters
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Detecting causal relationships in distributed computations: in search of the holy grail
Distributed Computing
Dealing with Global Guards in a Distributed Simulation of Colored Petri Nets
DS-RT '05 Proceedings of the 9th IEEE International Symposium on Distributed Simulation and Real-Time Applications
MPI-based distribution in DEVS simulation
IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
Expression-Level Parallelism for Distributed Spice Circuit Simulation
DS-RT '11 Proceedings of the 2011 IEEE/ACM 15th International Symposium on Distributed Simulation and Real Time Applications
Towards correct distributed simulation of high-level petri nets with fine-grained partitioning
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
The optimistic synchronization paradigm, Time Warp, allows logical processes to advance aggressively. In the circumstances where the violation of the local causality constraint (LCC) is prone to occurring, this optimism may introduce substantial rollbacks and, as a consequence, significant overhead in recovering from erroneous computations. In this paper, a new approach, COBTW, is proposed, where the happen before relation is employed to capture the potential violations of LCC and causal order is applied to regulate the advancement of logical processes. Due to the difference between causal order and time-stamp order, there are discrepancies between them. Solutions to remove the discrepancies are proposed. Experiments conducted in a cluster and an emulated WAN suggest that COBTW reduces rollbacks caused by violations of LCC and empirically results in better performance, in comparison with the Time Warp protocol.