作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2008, Vol. 34 ›› Issue (19): 38-40. doi: 10.3969/j.issn.1000-3428.2008.19.014

• 软件技术与数据库 • 上一篇    下一篇

一种基于最优网格的动态数据过滤机制

孙 睿,曹耀钦   

  1. (第二炮兵工程学院计算机系,西安 710025)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-10-05 发布日期:2008-10-05

Dynamic Data Filtering Mechanism Based on Best-grid

SUN Rui, CAO Yao-qin   

  1. (Dept. of Computer, The Second Artillery Engineering Institute, Xi’an 710025)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-10-05 Published:2008-10-05

摘要: 数据过滤机制是数据分发管理的核心,直接影响数据分发管理效率。该文提出一种基于最优网格的动态数据过滤机制,分析网格单元大小与更新区域网格数量、冗余信息数量的关系。实验结果表明,该机制可以提高数据过滤效率,降低系统开销并缩短仿真时间,实现了交互仿真的有效性、实时性和实用性。

关键词: 高层体系结构, 动态数据过滤机制, 最优网格

Abstract: Data filtering mechanism is the core of data distribution management, and directly affects the rate of data distribution management. This paper proposes a dynamic data filtering mechanism based on best-grid, and analyses the relationship between size of grid cell, quantity of grid in update area and unnecessary information. Experimental results show that the mechanism can improve the rate of data filter, reduce consume of the system and simulation time. It achieves the request of validity, real-time and practicability.

Key words: High Level Architecture(HLA), dynamic data filtering mechanism, best-grid

中图分类号: