• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Computational Science - ICCA 2003 Pt.2 Jun 2-4, 2003 Melbourne, Australia and St. Petersburg, Russia >Generalization of the Fast Consistency Algorithm to a Grid with Multiple High Demand Zones
【24h】

Generalization of the Fast Consistency Algorithm to a Grid with Multiple High Demand Zones

机译：快速一致性算法在具有多个高需求区域的网格上的推广

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

摘要

One of the main challenges of grid systems of large scale and data intensive is that of providing high availability and performance, in spite of the unreliability and delay occasioned by the size of Internet. Replication enables us to meet such a challenge with success. In the context of weak consistency, the fast consistency algorithm prioritizes replicas with high demand. Nevertheless, the fast consistency algorithm only works well in a single zone of high demand, whereas in multiple high demand zones its performance is poor. In this paper, we propose an algorithm chosen according to demand, whereby the replicas in each zone of high demand select leader replicas that subsequently construct a logical topology, linking all the replicas together. In this way, changes are able to reach all the high demand replicas without the low demand zones forming a barrier to prevent this from happening.
机译：尽管Internet规模带来不可靠和延迟，但是大规模和数据密集型网格系统的主要挑战之一是提供高可用性和高性能。复制使我们能够成功应对这样的挑战。在一致性较弱的情况下，快速一致性算法会优先考虑具有高需求的副本。但是，快速一致性算法仅在高需求区域中有效，而在多个高需求区域中，其性能很差。在本文中，我们提出了一种根据需求选择的算法，借此，高需求每个区域中的副本会选择领导者副本，这些副本随后会构成逻辑拓扑结构，将所有副本链接在一起。这样，更改就可以到达所有高需求副本，而低需求区域不会形成障碍来阻止这种情况的发生。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号