欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
为了充分利用游戏网格的计算资源，使用其强大的并行计算能力，部署在游戏网格的网络游戏必须要划分成可以并行的多个服务。提出了一种基于动态二叉树的游戏网格服务划分算法；讨论了如何采用二叉树的数据结构来组织服务节点并根据服务节点的负载动态调整其服务划分；最后实现一个模拟游戏网格环境，通过实验结果证明该算法可以取得良好的性能。
英文摘要：
In order to make the most of computing resources and computing power of game grid, the network game, deployed in game grid, should be divided into several parallel services. This paper put forward a game grid service partitioning algorithm based on dynamical binary space partitioning tree. It discussed how to use data structure of binary space partitioning tree to or- ganize service node and adjusted service division dynamically according to the load of service node, thus achieving a simulative game grid environment. In the end, the paper demonstrated the good performance of the game grid service partitioning algorithm through experiments.
同期刊论文项目
同项目期刊论文
期刊信息
位置：