A Parallel Hierarchical Sort-based Interest Matching Algorithm

Interest management is a filtering technique to reduce communication in simulation. It involves a process called "interest matching" to identify intersections between two sets of d-dimensional axis-parallel rectangles. Because of frequent demands in simulation execution, interest matching becomes a bottleneck as the problem size grows. However, classical interest matching algorithms, mainly designed for serial processing, do not take advantage of modern multicore processors' computing power. Recent parallel interest matching algorithms can fill the gap, but there is scope for improvement. In this paper, we propose a parallel hierarchical sort-based interest matching algorithm. It embeds subscription regions into an interest management tree and allows update regions compare with nodes of the tree to find results in parallel. The association between adjacent nodes and the hierarchical relation between parent-child nodes can serve to eliminate unnecessary operations. Moreover, we also provide proof to confirm the correctness and a detailed analysis of time-complexity. The experimental results demonstrate that the proposed algorithm can achieve better performance than state-of-art algorithms.