Journal of System Simulation
Abstract
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.
Recommended Citation
Tang, Wenjie; Cheng, Junwei; Yao, Yiping; and Feng, Zhu
(2021)
"A Shared Memory Based Parallel Hierarchical Interest Matching Algorithm,"
Journal of System Simulation: Vol. 33:
Iss.
5, Article 10.
DOI: 10.16182/j.issn1004731x.joss.20-0019
Available at:
https://dc-china-simulation.researchcommons.org/journal/vol33/iss5/10
First Page
1086
Revised Date
2020-04-20
DOI Link
https://doi.org/10.16182/j.issn1004731x.joss.20-0019
Last Page
1094
CLC
TP391.9
Recommended Citation
Tang Wenjie, Cheng Junwei, Yao Yiping, Zhu Feng. A Shared Memory Based Parallel Hierarchical Interest Matching Algorithm[J]. Journal of System Simulation, 2021, 33(5): 1086-1094.
DOI
10.16182/j.issn1004731x.joss.20-0019
Included in
Artificial Intelligence and Robotics Commons, Computer Engineering Commons, Numerical Analysis and Scientific Computing Commons, Operations Research, Systems Engineering and Industrial Engineering Commons, Systems Science Commons