Proceedings 16th Workshop on Parallel and Distributed Simulation (2002)
May 12, 2002 to May 15, 2002
Yu Jun , National University of Singapore
Come Raczy , National University of Singapore
Gary Tan , National University of Singapore
The High Level Architecture (HLA) 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. As the brute force approach does not scale well, the current implementations of DDM usually use a grid partitioning of the routing space to efficiently compute the intersection. Since this approach still has some shortcomings, we have focused our recent research on the design and the evaluation of different intersection algorithms for the DDM. In this paper, we introduce a new intersection algorithm in which regions are sorted before computing the intersections. The strong points of this algorithm are (1) the sort suppresses many useless checks, (2) the algorithm allows many optimizations at the implementation level. An experimental comparison of this algorithm with brute force and grid-based approach provides additional information about the good points and weak points of each of the three approaches.
high level architecture, runtime infrastructure, data distribution management, brute force algorithm, grid-based algorithm and sort-based algorithm
Y. Jun, C. Raczy and G. Tan, "Evaluation of a Sort-Based Matching Algorithm for DDM," Proceedings 16th Workshop on Parallel and Distributed Simulation(PADS), Washington, D.C., 2002, pp. 68.