首页> 外文会议>International confernce on computational science and its applications >A Comparison Study of Modern Heuristics for Solving the Partitioning Problem in Distributed Virtual Environment Systems
【24h】

A Comparison Study of Modern Heuristics for Solving the Partitioning Problem in Distributed Virtual Environment Systems

机译:近代启发式求解分布式虚拟环境系统分区问题的比较研究

获取原文

摘要

Fast Internet connections and the widespread use of high performance graphic cards are making Distributed Virtual Environment (DVE) systems very common nowadays. However, there are several key issues in these systems that should still be improved in order to design a scalable and cost-effective system. One of these key issues is the partitioning problem. This problem consists of efficiently assigning clients (3-D avatars) to the servers in the system. In this paper, we present a comparison study of different modern heuristics for solving the partitioning problem in DVE systems, as an alternative to the adhoc heuristic proposed in the literature. Performance evaluation results show that some of the heuristic methods can greatly improve the performance of the partitioning method, particularly for large DVE systems. In this way, efficiency and scalability of DVE systems can be significantly improved.
机译:快速的互联网连接和高性能图形卡的广泛使用是在现在非常常见的分布式虚拟环境(DVE)系统。但是,这些系统中存在几个关键问题,仍然应该得到改进,以便设计可扩展且经济高效的系统。其中一个关键问题是分区问题。此问题包括将客户端(3-D Avatars)有效分配给系统中的服务器。在本文中,我们提出了对DVE系统中的分区问题的不同现代启发式的比较研究,作为文献中提出的adhoc启发式的替代方案。绩效评估结果表明,一些启发式方法可以大大提高分区方法的性能,特别是对于大型DVE系统。以这种方式,可以显着改善DVE系统的效率和可扩展性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号