首页> 外文期刊>Distributed Computing >Randomized protocols for asynchronous consensus
【24h】

Randomized protocols for asynchronous consensus

机译:异步共识的随机协议

获取原文
获取原文并翻译 | 示例

摘要

The famous Fischer, Lynch, and Paterson impossibility proof shows that it is impossible to solve the consensus problem in a natural model of an asynchronous distributed system if even a single process can fail. Since its publication, two decades of work on fault-tolerant asynchronous consensus algorithms have evaded this impossibility result by using extended models that provide (a) randomization, (b) additional timing assumptions, (c) failure detectors, or (d) stronger synchronization mechanisms than are available in the basic model. Concentrating on the first of these approaches, we illustrate the history and structure of randomized asynchronous consensus protocols by giving detailed descriptions of several such protocols.
机译:著名的Fischer,Lynch和Paterson不可能证明表明,即使单个进程可能失败,也无法解决异步分布式系统自然模型中的共识问题。自发布以来,通过使用提供(a)随机化,(b)额外的时序假设,(c)故障检测器或(d)更强的同步性的扩展模型,容错异步共识算法的二十年工作逃避了这种不可能的结果。基本模型中没有的机制。专注于这些方法中的第一种,我们通过对几种此类协议的详细描述来说明随机异步共识协议的历史和结构。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号