首页> 外文会议>International Conference on Computational Science and Its Applications - ICCSA 2003 Pt.3 May 18-21, 2003 Montreal, Canada >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 ad-hoc 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.
机译:快速的Internet连接和高性能图形卡的广泛使用使分布式虚拟环境(DVE)系统在当今非常普遍。但是,这些系统中有几个关键问题仍需要改进,以设计可伸缩且具有成本效益的系统。这些关键问题之一是分区问题。该问题包括有效地将客户端(3-D头像)分配给系统中的服务器。在本文中,我们将对解决DVE系统中分区问题的不同现代启发式方法进行比较研究,以替代文献中提出的临时启发式方法。性能评估结果表明,某些启发式方法可以大大提高分区方法的性能,特别是对于大型DVE系统。这样,可以显着提高DVE系统的效率和可伸缩性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号