• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2006, Vol. 28 ›› Issue (9): 80-82.

• 论文 • 上一篇    下一篇

一种改进的基于排序的区域匹配算法

黄红兵 叶超群 金士尧   

  • 出版日期:2006-09-01 发布日期:2010-05-20

  • Online:2006-09-01 Published:2010-05-20

摘要:

兴趣匹配是分布仿真中兴趣管理的关键环节,其速度和精度影响着兴趣管理的性能。基于排序的区域匹配算法是针对HLA/DDM的有效算法,但它只是利用了对范围界点排序而带来的空间关系启发信息,其匹配效率还有值得改进的地方。本文首先分析了匹配算法的实质,然后研究了实际分布仿真系统中实体运行时的局部性,并利用这种局部性对匹
匹配算法进行改进,给出了改进算法,进而对改进算法和原算法进行了比较测试,最后给出了结论和进一步的工作展望。

关键词: 区域匹配算法 兴趣管理 数据分发管理

Abstract:

Interest matching is the key to interest management in distributed simulation. Its speed and precision affects the efficiency of interest management.  The sort-based algorithm for region matching is efficient for HLA/DDM. But it only takes the advantage of the heuristic information implied in the locat  ion relationships between regions, which can be deduced from the sorted list of range bounds. It can he improved by other means. In this paper, the esse nce of the sort-based algorithm is analysed first,and then the runtime locality of the simulation entity is studied. And, by using this locality, we pre  sent an improved algorithm. After this, comparative tests are taken. Finally, a conclusion and the future trend are given.

Key words: (region matching algorithm;interest management;DDM)