• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Computational Science - ICCA 2003 Pt.2 Jun 2-4, 2003 Melbourne, Australia and St. Petersburg, Russia >Efficient Load Balancing by Adaptive Bypasses for the Migration on the Internet
【24h】

Efficient Load Balancing by Adaptive Bypasses for the Migration on the Internet

机译：通过自适应旁路进行有效的负载平衡，以实现Internet上的迁移

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

We study a dynamic load balancing problem for servers on the Internet as Grid, based on the differences of distributed computing to parallel computing. We propose an adaptive method according to initially assigned load; the optimal migration flow is directly obtained without any iterations, and the conditions of migration for the bottleneck edges are relaxed by the bypasses on a cactus adaptively extended from a spanning tree. Simulation results show that the number of rounds for the migration is decreased under 2/3 for the conventional method, and that the cost with respect to the instability of migration is also decreased in about the half. Thus, the adaptively constructed cactus is considered as a practically efficient topology.
机译：基于分布式计算与并行计算的差异，我们研究了互联网上作为网格的服务器的动态负载平衡问题。我们根据初始分配的负载提出了一种自适应方法。可以直接获得最佳迁移流程，而无需进行任何迭代，并且通过从生成树中自适应扩展的仙人掌上的旁路来缓解瓶颈边缘的迁移条件。仿真结果表明，与传统方法相比，迁移的轮数减少到2/3以下，并且迁移不稳定性的成本也降低了一半左右。因此，自适应构建的仙人掌被认为是实用的拓扑结构。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号