Please use this identifier to cite or link to this item: https://doi.org/10.1145/1044322.1044324
Title: A sort-based DDM matching algorithm for HLA
Authors: Raczy, C. 
Tan, G. 
Yu, J. 
Keywords: Data distribution management
Data filtering
Distributed Simulation
High level architecture
Sort-based matching algorithm
Issue Date: 2005
Source: Raczy, C.,Tan, G.,Yu, J. (2005). A sort-based DDM matching algorithm for HLA. ACM Transactions on Modeling and Computer Simulation 15 (1) : 14-38. ScholarBank@NUS Repository. https://doi.org/10.1145/1044322.1044324
Abstract: The High Level Architecture (HLA) is an architecture for reuse and interoperation of simulations. It provides several Data Distribution Management (DDM) services to reduce the transmission and reception of irrelevant data. These services rely on the computation of the intersection between "update" and "subscription" regions. Currently, there are several main DDM filtering algorithms. Since each approach still has some shortcomings, we have focused our research on the design and the evaluation of intersection algorithms for the DDM. In this article, we introduce a new algorithm in which extents are sorted before computing the intersections. Our experiments show that usually the sort-based algorithm has the best performance among all approaches. The improvement of its performance ranges between 30% and 99% over the brute force and hybrid approaches. © 2005 ACM.
Source Title: ACM Transactions on Modeling and Computer Simulation
URI: http://scholarbank.nus.edu.sg/handle/10635/39773
ISSN: 10493301
DOI: 10.1145/1044322.1044324
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

40
checked on Dec 12, 2017

Page view(s)

76
checked on Dec 15, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.