• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>電子情報通信学会技術研究報告. コンピュテ-ション. Theoretical Foundations of Computing >Failure Detectors for the Leader Election with Bounded Faulty Processes
【24h】

Failure Detectors for the Leader Election with Bounded Faulty Processes

机译：缺陷程序有界的领导者选举的故障检测器

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

摘要

Determining the "weakest" failure detectors is a central topic in asynchronous fault-tolerant distributed system, and indeed the weakest failure detectors have been proposed for several fundamental problems such as Consensus, Non-Blocking Atomic Commit, and Leader Election. We consider failure detectors to solve the leader election problem with f faulty processes, under the assumption that future never affect the output of a failure detector. Sabel et. al. showed the weakest failure detector for the leader election is P, perfect failure detector, with any number of faulty processes under some restricted conditions, and Delporte-Gallet et.al. showed the result holds under more realistic constraints. In this paper, we propose a new failure detector class Μ to solve the leader election with less than [n/2] faulty processes, and show that Μ is strictly weaker than P. That is, there is a hardness gap of the leader election with respect to the number of faulty processes.
机译：在异步容错分布式系统中，确定“最弱”故障检测器是一个中心主题，实际上，针对一些基本问题（例如共识，无阻塞原子提交和领导者选举）已经提出了最弱的故障检测器。在未来永远不会影响故障检测器的输出的假设下，我们考虑使用故障检测器来解决具有f个错误过程的领导者选举问题。萨贝尔（Sabel）等等表明领导者选举中最弱的故障检测器是P，完美故障检测器，在某些受限条件下具有任意数量的故障过程，Delporte-Gallet等。表明结果保持在更现实的约束下。在本文中，我们提出了一种新的故障检测器类别Μ，以解决少于[n / 2]个错误过程的领导者选举，并表明Μ严格比P弱。也就是说，领导者选举存在硬度差距关于故障过程的数量。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号