The Community for Technology Leaders
2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation (2008)
June 3, 2008 to June 6, 2008
ISSN: 1087-4097
ISBN: 978-0-7695-3159-5
pp: 203-211
ABSTRACT
The High Level Architecture (HLA), which is the IEEE standard for distributed simulation, defines six service groups. The Time Management (TM) service group ensures a Time-Stamp-Ordered (TSO) message delivery sequence and correct time advancement of each simulation component (federate) in an HLA-based distributed simulation application (federation). To control time advancement of a federation, a distributed TM algorithm requires each regulating federate to periodically propagate its local time information to all constrained federates for their respective calculation of Greatest Available Logical Time (GALT). The time information propagated is called conditional information or unconditional information depending on whether it can be guaranteed to be true conditionally or unconditionally. A traditional distributed TMalgorithm can be either synchronous or asynchronous. In general, a synchronous algorithm utilizes conditional information while an asynchronous algorithm utilizes unconditional information. However, both synchronous and asynchronous algorithms have their own drawbacks and thus cannot be used for all federation scenarios. To resolve the drawback of each algorithm, this paper proposes a hybrid TM algorithm by combining synchronous and asynchronous algorithms. The three algorithms have been incorporated into an RTI (Run Time Infrastructure) and experimental results show that the hybrid algorithm effectively combines the advantages of both synchronous and asynchronous algorithms.
INDEX TERMS
Distributed Simulation, HLA, Time Management Algorithm
CITATION
Ke Pan, Stephen John Turner, Wentong Cai, Zengxiang Li, "A Hybrid HLA Time Management Algorithm Based on Both Conditional and Unconditional Information", 2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation, vol. 00, no. , pp. 203-211, 2008, doi:10.1109/PADS.2008.11
92 ms
(Ver 3.3 (11022016))