Study on game grid service partitioning algorithm
游戏网格服务划分算法研究

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 organize 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.