大规模协同虚拟环境下并行层次兴趣匹配算法  

Parallel hierarchical interest matching algorithm in large-scale collaborative virtual environment

作　　者：郦丽华[1] LI Li-hua(Information Technology Branch,Zhejiang Yuying College of Vocational Technology,Zhejiang Hangzhou 310018,China)

机构地区：[1]浙江育英职业技术学院信息技术学院,浙江杭州310018

出　　处：《齐齐哈尔大学学报（自然科学版）》2024年第2期51-55,83,共6页Journal of Qiqihar University(Natural Science Edition)

摘　　要：大规模协同虚拟环境运行过程中易产生大量冗余通信数据,影响虚拟现实技术性能的发挥。为了提升虚拟环境运行效率,提出并行层次兴趣匹配算法。创建协同虚拟环境概念模型,分解处理订阅区域信息,引入树结构理论搭建兴趣管理树,将订阅区域映射到兴趣管理树节点上,形成层次化结构,结合LSQR并行算法,实现更新区域与订阅区域的快速匹配。实验结果表明,提出算法获得的兴趣匹配消耗时间最小值为0.36 s,兴趣匹配成功指数最大值为0.94,充分证实了提出算法兴趣匹配性能较好。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.

关 键 词：协同虚拟环境 兴趣匹配 多层次并行 大规模 并行算法 仿真场景 

分 类 号：TP391.1[自动化与计算机技术—计算机应用技术]