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)
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
Distributed Concurrency Control in Real-time Cooperative Editing Systems
ASIAN '96 Proceedings of the Second Asian Computing Science Conference on Concurrency and Parallelism, Programming, Networking, and Security
Critical causality in distributed virtual environments
Proceedings of the sixteenth workshop on Parallel and distributed simulation
Parallel simulation: parallel and distributed simulation systems
Proceedings of the 33nd conference on Winter simulation
Parallel simulation: distributed simulation systems
Proceedings of the 35th conference on Winter simulation: driving innovation
An alternative time management mechanism for distributed simulations
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Bias in parallel and distributed simulation systems
WSC '05 Proceedings of the 37th conference on Winter simulation
Parallel and distributed simulation: traditional techniques and recent advances
Proceedings of the 38th conference on Winter simulation
Parallel and Distributed Spatial Simulation of Chemical Reactions
Proceedings of the 22nd Workshop on Principles of Advanced and Distributed Simulation
A New Algorithm for VHDL Parallel Simulation
ACM Transactions on Design Automation of Electronic Systems (TODAES)
A time management optimization framework for large-scale distributed hardware-in-the-loop simulation
Proceedings of the 2013 ACM SIGSIM conference on Principles of advanced discrete simulation
| Hi-index | 0.00 |
One of the six categories of management services provided in the Run Time Infrastructure (RTI) to federated simulations is Time Management. Currently, it provides only two message ordering policies, that is, time stamp ordering and receive ordering. Temporal anomalies occurred during the execution of federation due to the heterogeneous latencies in the communication network are not handled in receive ordering. White time stamp ordering eliminates the temporal anomalies entirely, it incurs great communication latency and huge handwidth requirement. This paper presents a new time management mechanism which provides a less costly message ordering service, namely causal ordering, to federates. It does not require the specification of lookahead and allows federates that do not require stringent message ordering properties to achieve much more efficient execution. A series of experiments has been carried out to benchmark the performance of this new time management mechanism and the results show that if incurs a slight overhead compared to receive ordering mechanism but achieves significant performance improvement over time stamp ordering mechanism.