Optimizing cell-size in grid-based DDM
PADS '00 Proceedings of the fourteenth workshop on Parallel and distributed simulation
Evaluation of a sort-based matching algorithm for DDM
Proceedings of the sixteenth workshop on Parallel and distributed simulation
Grid-Based Data Management in Distributed Simulation
SS '00 Proceedings of the 33rd Annual Simulation Symposium
A Hybrid Approach to Data Distribution Management
DS-RT '00 Proceedings of the Fourth IEEE International Workshop on Distributed Simulation and Real-Time Applications
Performance Comparison of Data Distribution Management Strategies
DS-RT '01 Proceedings of the Fifth IEEE International Workshop on Distributed Simulation and Real-Time Applications
An adaptive, distributed algorithm for interest management
An adaptive, distributed algorithm for interest management
An Efficient Sort-Based DDM Matching Algorithm for HLA Applications with a Large Spatial Environment
Proceedings of the 21st International Workshop on Principles of Advanced and Distributed Simulation
MGRID: a modifiable-grid region matching approach for DDM in the HLA RTI
SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
An Approach for Parallel Interest Matching in Distributed Virtual Environments
DS-RT '09 Proceedings of the 2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications
A dynamic sort-based DDM matching algorithm for HLA applications
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Implementation of data distribution management services in a service oriented HLA RTI
Winter Simulation Conference
A scalable data distribution management approach
Proceedings of the 2010 Summer Computer Simulation Conference
A Continuous Matching Algorithm for Interest Management in Distributed Virtual Environments
PADS '10 Proceedings of the 2010 IEEE Workshop on Principles of Advanced and Distributed Simulation
A Parallel Interest Matching Algorithm for Distributed-Memory Systems
DS-RT '11 Proceedings of the 2011 IEEE/ACM 15th International Symposium on Distributed Simulation and Real Time Applications
An interest filtering mechanism based on loi
ICAT'06 Proceedings of the 16th international conference on Advances in Artificial Reality and Tele-Existence
Moving-intersecting-information-based matching algorithm for dynamic DDM
SCSC '09 Proceedings of the 2009 Summer Computer Simulation Conference
Transparent optimistic synchronization in the high-level architecture via time-management conversion
ACM Transactions on Modeling and Computer Simulation (TOMACS)
A binary partition-based matching algorithm for data distribution management
Proceedings of the Winter Simulation Conference
An interest management scheme for mobile peer-to-peer systems
Proceedings of the Winter Simulation Conference
A fast parallel matching algorithm for continuous interest management
Proceedings of the Winter Simulation Conference
Optimizing Pairwise Box Intersection Checking on GPUs for Large-Scale Simulations
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Interest management for distributed virtual environments: A survey
ACM Computing Surveys (CSUR)
A Parallel Data Distribution Management Algorithm
DS-RT '13 Proceedings of the 2013 IEEE/ACM 17th International Symposium on Distributed Simulation and Real Time Applications
| Hi-index | 0.00 |
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.