%0 Journal Article
%T Study on game grid service partitioning algorithm<br>游戏网格服务划分算法研究
%A XUE Sheng-jun
%A ZHANG Xiao-hua
%A <br>薛胜军
%A 张小华
%J 计算机应用研究
%D 2009
%I 
%X 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.
%K game grid
%K service partition
%K load balance<br>游戏网格
%K 服务划分
%K 负载平衡
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=79EA57B6A2D6D5BC62735180D96B7E75&yid=DE12191FBD62783C&vid=96C778EE049EE47D&iid=CA4FD0336C81A37A&sid=0D0D661F0B316AD5&eid=656F8C8401D91023&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=7