A dynamical adjustment partitioning algorithm for distributed virtual environment systems

  • Authors:
  • Wei ning;Cai Hong-ming;Jiang Li-hong

  • Affiliations:
  • Shanghai JiaoTong University;Shanghai JiaoTong University;Shanghai JiaoTong University

  • Venue:
  • VRCAI '08 Proceedings of The 7th ACM SIGGRAPH International Conference on Virtual-Reality Continuum and Its Applications in Industry
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Fast Internet connections and fast development of the high performance graphic cards make the application of Distributed Virtual Environment systems more and more common today. In order to build a cost-effective DVE system, how to solve the partitioning problem is the key problem. Especially, with the application of web based DVE systems, the partitioning algorithms have to fulfill the requirement of real-time and quick-response. Also, in web based DVE systems, the avatars are always clustered distribution, so the partitioning algorithm should be able to deal with this situation in high efficiency. In order to solve the partitioning problem in web based DVE systems, this paper proposes a dynamic adjustment partitioning algorithm which imports dynamic weights of computational cost and communication cost and also takes into account the factor of CPU utilization, and can deal with the changes of the avatars' states dynamically in a short execution time. Also, this algorithm tends to assign avatars of a high density area in a DVE system to a single server, in this way, the inter-server messages can be reduced. Therefore, this quick-response algorithm can serve the web based DVE systems very well and the scalability and efficiency of the DVE systems has been improved.