R-tree Method of Matching Algorithm for Data Distribution Management

2006 ◽  
Vol 43 (2) ◽  
pp. 362 ◽  
Author(s):  
Xi Jiang
Keyword(s):  
Data Distribution ◽  
Matching Algorithm ◽  
Distribution Management ◽  
Tree Method

A parallel matching algorithm based on order relation for HLA data distribution management

2015 ◽  
Vol 06 (02) ◽  
pp. 1540002 ◽  
Author(s):  
Yanbing Liu ◽  
Hongbo Sun ◽  
Wenhui Fan ◽  
Tianyuan Xiao
Keyword(s):  
Data Distribution ◽  
Order Relation ◽  
Divide And Conquer ◽  
Experimental Result ◽  
Matching Algorithm ◽  
Distribution Management ◽  
Computational Overhead ◽  
Matching Process ◽  
Region Matching ◽  
Matching Rules

In distribution simulation based on High-level architecture (HLA), data distribution management (DDM) is one of HLA services for the purpose of filtering the unnecessary data transferring over the network. DDM admits the sending federates and the receiving federates to express their interest using update regions and subscription regions in a multidimensional routing space. There are several matching algorithms to obtain overlap information between the update regions and subscription regions. When the number of regions increase sharply, the matching process is time consuming. However, the existing algorithms is hard to be parallelized to take advantage of the computing capabilities of multi-core processors. To reduce the computational overhead of region matching, we propose a parallel algorithm based on order relation to accelerate the matching process. The new matching algorithm adopts divide-and-conquer approach to divide the regions into multiple region bound sublists, each of which comprises parts of region bounds. To calculate the intersection inside and amongst the region bound sublists, two matching rules are presented. This approach has good performance since it performs region matching on the sublists parallel and does not require unnecessary comparisons within regions in different sublists. Theoretical analysis has been carried out for the proposed algorithm and experimental result shows that the proposed algorithm has better performance than major existing DDM matching algorithms.

Dynamic Grid-Based Algorithms in DDM

2012 ◽  
Vol 433-440 ◽  
pp. 4297-4301
Author(s):  
Hui Ru Wang ◽  
Jing Ding
Keyword(s):  
Large Scale ◽  
Data Distribution ◽  
Experimental Results ◽  
Interactive Simulation ◽  
Distribution Management ◽  
Distributed Interactive Simulation ◽  
Dynamic Multicast ◽  
Grid Based

For large-scale distributed interactive simulation, it is important and difficult for data to communicate among thousands of objects. The purpose of the Data Distribution Management (DDM) service performs data filter and reduces irrelevant data between federations. Grid-based algorithm can only manage to filter part of irrelevant data. Experimental results show that, compare with normal grid-based algorithms, the dynamic multicast method can minimize.

Sign in / Sign up

Export Citation Format

Share Document