【24h】

Local Algorithms: Self-stabilization on Speed

机译:本地算法:自我稳定速度

获取原文

摘要

Fault tolerance is one of the main concepts in distributed computing. It has been tackled from different angles, e.g. by building replicated systems that can survive crash failures of individual components, or even systems that can tolerate a minority of arbitrarily malicious ("Byzantine") participants. Self-stabilization, a fault tolerance concept coined by the late Edsger W. Dijkstra in 1973 [1,2], is of a different stamp. A self-stabilizing system must survive arbitrary failures, beyond Byzantine failures, including for instance a total wipe out of volatile memory at all nodes. In other words, the system must self-heal and converge to a correct state even if starting in an arbitrary state, provided that no further faults happen.
机译:容错是分布式计算中的主要概念之一。它已从不同的角度粘附,例如,通过构建可以在各个组件的碰撞失败的复制系统,甚至可以容忍少数任意恶意(“拜占庭)参与者的崩溃失败。自我稳定,1973年在1973年的Dijkstra的已故的容错概念[1,2],是不同的印章。自稳定系统必须存活任意故障,超出拜占庭故障,包括例如在所有节点上的易失性存储器中的总擦除。换句话说,即使以任意状态开始,系统必须自我愈合并收敛到正确的状态,只要不发生任何进一步的故障即可。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号