ACM Home Page
Please provide us with feedback. Feedback
A Hybrid HLA Time Management Algorithm Based on Both Conditional and Unconditional Information
Full text PdfPdf (248 KB)
Source Workshop on Parallel and Distributed Simulation archive
Proceedings of the 22nd Workshop on Principles of Advanced and Distributed Simulation table of contents
Pages 203-211  
Year of Publication: 2008
ISBN ~ ISSN:1087-4097 , 978-0-7695-3159-5
Authors
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 34,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: 10.1109/PADS.2008.11

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
R. E. Bryant. Simulation of packet communication archi tecture computer systems. Master's thesis, Massachusetts Institute of Technology, 1977.
 
2
 
3
 
4
 
5
R. M. Fujimoto. Lookahead in parallel discrete event simulation. In International Conference on Parallel Processing, Volume 3, pages 34-41, 1988.
 
6
R. M. Fujimoto. Time management in the high level architecture. SIMULATION Special Issue on High Level Architecture , 71(6):388-400, 1998.
 
7
 
8
 
9
Globus Alliance. Globus Toolkit Version 4. Available via http://www.globus.org/.
 
10
IEEE. Standard 1516 (HLA Rules), 1516.1 (Federate Interface Specification) and 1516.2 (Object Model Template), 2000.
11
 
12
K. Pan, S. J. Turner, W. Cai, and Z. Li. A service oriented HLA RTI on the Grid. In International Conference on Web Services, pages 984-992, 2007.
 
13
 
14
J. Steinman. SPEEDES: Synchronous parallel environment for emulation and discrete event simulation. In Advances in Parallel and Distributed Simulation, pages 95-103, 1991.


Collaborative Colleagues:
Ke Pan: colleagues
Stephen John Turner: colleagues
Wentong Cai: colleagues
Zengxiang Li: colleagues