Journal of System Simulation ›› 2021, Vol. 33 ›› Issue (5): 1086-1094.doi: 10.16182/j.issn1004731x.joss.20-0019

Previous Articles     Next Articles

A Shared Memory Based Parallel Hierarchical Interest Matching Algorithm

Tang Wenjie, Cheng Junwei, Yao Yiping*, Zhu Feng   

  1. College of Systems Engineering, National University of Defense Technology, Changsha 410073, China
  • Received:2020-01-07 Revised:2020-04-20 Online:2021-05-18 Published:2021-06-09

Abstract: Interest matching plays an important role in distributed simulation. However, because of huge number of simulation entities and frequent change of regions, interest matching consumes tremendous computation in large scale simulations. The ubiquity of multicore urges us to improve the performance of interest matching by parallelization. A shared memory based parallel hierarchical interest matching algorithm is propose to solve the problem. It maps subscribe regions into a full binary tree, and compares update regions with the tree in parallel. Due to the associative relationship between adjacent nodes, unnecessary comparisons can be eliminated. The experimental results demonstrate that the proposed algorithm has good scalability and can effectively improve the efficiency of interest matching.

Key words: interest matching, parallel algorithm, distributed simulation, sort-based matching

CLC Number: