DDM中基于历史信息排序的区域匹配算法  

Region Matching Algorithm Based on Historical Information Sorting in DDM

作　　者：王卓 冯晓宁[2] 刘廷宝[2] 

机构地区：[1]哈尔滨工程大学水下机器人技术国防科技重点实验室,哈尔滨150001 [2]哈尔滨工程大学计算机科学与技术学院,哈尔滨150001

出　　处：《计算机科学》2011年第10期202-204,214,共4页Computer Science

基　　金：黑龙江省青年科学基金项目(2007Q0502-00);哈尔滨市青年科学基金项目(RC2009QN010039);哈尔滨工程大学校基础研究基金项目(002060260722);水下智能机器人技术国防科技重点实验室开放课题研究基金项目(2010004)资助

摘　　要：DDM实现的关键是更新区域和订购区域的匹配判断,其匹配算法的设计决定着分布式仿真的效率和性能。针对直接匹配算法需要维护的区域相交索引表和相交信息表的存储空间不断扩大的问题,首先提出区域聚合的基本思想及其实现方式,然后提出将历史信息排序加入到区域匹配算法中,以使算法在有效利用历史信息的基础上,提高区域匹配的运行效率。给出了算法的基本思想和具体步骤,通过应用实例详细解释了算法的具体实现过程,最后通过仿真实验,对比分析了所提算法的优缺点。The key point of DDM implementation is to match the update region sets with the subscription region sets.The efficiency and performance of the distributed simulation system is determined by the design of matching algorithm.The matching algorithm must maintain the index form and the information form of region intersection.And the problem is that the forms are constantly extended.Firstly,the idea and realization of region aggregation were provided.Secondly,historical information sorting was added to the region matching algorithm.Therefore,the running efficiency of region matching was improved on the base of using historical information.The basic idea and detail process of the algorithm were provided in the paper.The implementation process of algorithm was amply explained by the application example.Finally,the advantage and disadvantage of the algorithm were analyzed by the simulation data.

关 键 词：HLA RTI 数据分发管理 区域匹配算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]