The causal ordering abstraction and a simple way to implement it
Information Processing Letters
Lightweight causal and atomic group multicast
ACM Transactions on Computer Systems (TOCS)
Time management in the DoD high level architecture
PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation
An adaptive causal ordering algorithm suited to mobile computing environments
Journal of Parallel and Distributed Computing
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A New Algorithm to Implement Causal Ordering
Proceedings of the 3rd International Workshop on Distributed Algorithms
Performance of the Optimal Causal Multicast Algorithm: A Statistical Analysis
IEEE Transactions on Parallel and Distributed Systems
An alternative time management mechanism for distributed simulations
ACM Transactions on Modeling and Computer Simulation (TOMACS)
| Hi-index | 0.00 |
In conservative distributed simulation systems, data synchronization can be achieved by using time stamps or causality tracking. Message ordering techniques based on time-stamps usually cause serious performance problems by impeding possible concurrency. On the other hand, causality based methods introduces minimal delay on message processing but requires large control information to be appended to messages. Both transmission and handling of control information are drawbacks of such methods. In this study, two causality based message ordering algorithms MSES (Modified Schipper-Egglie-Sandoz) and KS (Kshemkalyani-Singhal) are studied. The algorithms are implemented and tested on a common simulation environment. Both theoretical and experimental analysis and comparison of the algorithms are presented.