• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Cyclic Storage for Fault-Tolerant Distributed Executions
【24h】

Cyclic Storage for Fault-Tolerant Distributed Executions

机译：容错分布式执行的循环存储

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

摘要

Given a set V of active components in charge of a distributed execution, a storage scheme is a sequence B_{0}, B_{1}, ldots, B_{b-1} of subsets of V, where successive global states are recorded. The subsets, also called blocks, have the same size and are scheduled according to some fixed and cyclic calendar of b steps. During the irm th step, block B_{i} is selected. Each component takes a copy of its local state and sends it to one of the components in B_i, in such a way that each component stores (approximately) the same number of local states. Afterward, if a component of B_{i} crashes, all of its stored data is lost and the computation cannot continue. If there exists a block with no failed components in it, then a recent global state can be retrieved and the computation does not need to start over from the very beginning. The goal is to design storage schemes that tolerate as many crashes as possible, while trying to have each component participating in as few blocks as possible and, at the same time, working with large blocks (so that a component in a block stores a small number of local states). In this paper, several such schemes are described and compared in terms of these measures.
机译：给定负责分布式执行的一组活动组件V，存储方案是V的子集的序列B_ {0}，B_ {1}，ldots，B_ {b-1}，其中记录了连续的全局状态。子集（也称为块）具有相同的大小，并根据b步的固定和循环日历进行调度。在第irm步中，选择了块B_ {i}。每个组件获取其本地状态的副本，然后将其发送到B_i中的一个组件，以这样的方式，每个组件存储（大约）相同数量的本地状态。之后，如果B_ {i}的某个组件崩溃，则其所有存储的数据都会丢失，并且计算无法继续。如果存在一个没有故障组件的块，则可以检索到最近的全局状态，并且不需要从头开始计算。目标是设计一种存储方案，该方案可容忍尽可能多的崩溃，同时尝试使每个组件尽可能少地参与到块中，并同时处理大型块（以使块中的组件存储一个较小的块）。州的数量）。在本文中，描述了几种此类方案，并根据这些措施进行了比较。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号