Parallel hierarchical interest matching algorithm in large-scale collaborative virtual environment
During the operation of large-scale collaborative virtual environment,a large number of redundant communication data are easily generated,which affects the performance of virtual reality technology.In order to improve the efficiency of virtual environment,a parallel hierarchical interest matching algorithm is proposed.Create a conceptual model of collaborative virtual environment,decompose and process the subscription area information,and on this basis,introduce the tree structure theory to build an interest management tree,map the subscription area to the interest management tree node,form a hierarchical structure,and combine LSQR parallel algorithm to achieve rapid matching between the update area and the subscription area.The experimental results show that the minimum consumption time of interest matching obtained by the proposed algorithm is 0.36 s,and the maximum success index of interest matching is 0.94,which fully proves that the proposed algorithm has better performance of interest matching.
NETL
NSTL
万方数据
