基于拓扑信息的HLA/RTI矢量时间管理

Chunpeng Chen, Hongjin Jia
{"title":"基于拓扑信息的HLA/RTI矢量时间管理","authors":"Chunpeng Chen, Hongjin Jia","doi":"10.1109/PADS.2012.47","DOIUrl":null,"url":null,"abstract":"Aimed to reduce the overheads using the Time Management (TM) in HLA based distributed simulations, the TM based on publish-subscribe topology information is investigated. The condition under which the message may be received before its causal predecessor is firstly analyzed. And then, the TM algorithms using vector clock are put forward, in which the condition is judged before the clock is comparing. The algorithms will reduce overheads in many distributed simulation systems where topology information is static and reasonably sparse.","PeriodicalId":194781,"journal":{"name":"Workshop on Parallel and Distributed Simulation","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Vector Time Management Based on Topology Information for HLA/RTI\",\"authors\":\"Chunpeng Chen, Hongjin Jia\",\"doi\":\"10.1109/PADS.2012.47\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Aimed to reduce the overheads using the Time Management (TM) in HLA based distributed simulations, the TM based on publish-subscribe topology information is investigated. The condition under which the message may be received before its causal predecessor is firstly analyzed. And then, the TM algorithms using vector clock are put forward, in which the condition is judged before the clock is comparing. The algorithms will reduce overheads in many distributed simulation systems where topology information is static and reasonably sparse.\",\"PeriodicalId\":194781,\"journal\":{\"name\":\"Workshop on Parallel and Distributed Simulation\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-07-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Workshop on Parallel and Distributed Simulation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PADS.2012.47\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on Parallel and Distributed Simulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PADS.2012.47","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

为了减少时间管理在HLA分布式仿真中的开销,研究了基于发布-订阅拓扑信息的时间管理。在消息的因果前体被首先分析之前,该消息可能被接收的条件。在此基础上,提出了基于矢量时钟的TM算法,该算法在对时钟进行比较前先对条件进行判断。该算法将减少许多分布式仿真系统的开销,其中拓扑信息是静态和合理稀疏的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Vector Time Management Based on Topology Information for HLA/RTI
Aimed to reduce the overheads using the Time Management (TM) in HLA based distributed simulations, the TM based on publish-subscribe topology information is investigated. The condition under which the message may be received before its causal predecessor is firstly analyzed. And then, the TM algorithms using vector clock are put forward, in which the condition is judged before the clock is comparing. The algorithms will reduce overheads in many distributed simulation systems where topology information is static and reasonably sparse.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信