Shared variables in distributed simulation
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
Implementations of dispatch rules in parallel manufacturing simulation
Proceedings of the 30th conference on Winter simulation
Creating computer simulation systems: an introduction to the high level architecture
Creating computer simulation systems: an introduction to the high level architecture
Proceedings of the 32nd conference on Winter simulation
Optimistic synchronization in HLA based distributed simulation
Proceedings of the eighteenth workshop on Parallel and distributed simulation
Investigating Distributed Simulation at The Ford Motor Company
DS-RT '05 Proceedings of the 9th IEEE International Symposium on Distributed Simulation and Real-Time Applications
SOAr-DSGrid: Service-Oriented Architecture for Distributed Simulation on the Grid
Proceedings of the 20th Workshop on Principles of Advanced and Distributed Simulation
A COTS Simulation Package Emulator (CSPE) for investigating COTS simulation package interoperability
WSC '05 Proceedings of the 37th conference on Winter simulation
Hi-index | 0.00 |
The HLA Runtime Infrastructure can support a conservative simulation protocol for its time management service. However, the performance of conservative simulation protocols is very much dependent on lookahead that one can extract out of a simulation model. Also the most conservative value has to be taken in order to ensure the causality constraint. In this paper, we propose two algorithms, namely pullRO and pushRO, that allow one to replace some of the timestamp order (TSO) messages (possibly those causing zero lookahead values) with receive order (RO) messages. This removes the time constraint that these messages impose on the lower bound timestamp (LBTS) calculation, which in turn will improve the time advancement rate of federates. The algorithms still ensure the causality constraint and a middleware approach is used to preserve the semantics of the RTI APIs. The performance of the two algorithms is compared against a baseline model where no TSO messages are replaced.