ACM Home Page
Please provide us with feedback. Feedback
A causality based time management mechanism for federated simulation
Full text Publisher SitePublisher Site PdfPdf (643 KB)
Source Workshop on Parallel and Distributed Simulation archive
Proceedings of the fifteenth workshop on Parallel and distributed simulation table of contents
Lake Arrowhead, California, United States
Pages: 83 - 90  
Year of Publication: 2001
ISBN:0-7695-1104-X
Authors
Bu-Sung Lee  School of Computer Engineering, Nanyang Technological University, Singapore
Wentong Cai  School of Computer Engineering, Nanyang Technological University, Singapore
Junlan Zhou  School of Computer Engineering, Nanyang Technological University, Singapore
Sponsors
SCS : Society for Computer Simulation
IEEE-CS\TCSIM : TC on Simulation
SIGSIM: ACM Special Interest Group on Simulation and Modeling
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 23,   Citation Count: 6
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   

ABSTRACT

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.


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
Fast Messages. http:://www-csag.ucsd.edu/projects/comm /fm.html.
 
2
Federated Simulations Development Kit (FDK). Georgia Institute of Technology. http://www.cc.gatech.edu/computing /pads/fdk.html.
 
3
HLA Time Management Design Document, version 1.0. U.S. Department of Defense, August 1996.
 
4
High Level Architecture interface specification, version 1.3. U.S. Department of Defense, April 1998.
5
 
6
C. J. Fidge. Timestamps in message-passing systems that preserve the partial ordering. Australian Computer Science Communication, 10(1 ):56-66, February 1988.
 
7
R. Fujimoto. RTI-Kit V0.2 Specification. Georgia Technological University, (18), March 1998.
 
8
9
 
10
 
11
 
12
 
13
 
14
J. Zhou. A causality-based time management mechanism, Master Thesis. August 2000.

CITED BY  7
 
 
 
 
 
 

Collaborative Colleagues:
Bu-Sung Lee: colleagues
Wentong Cai: colleagues
Junlan Zhou: colleagues

Peer to Peer - Readers of this Article have also read: