• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Computational Science and Its Applications(ICCSA 2006) pt.5; 20060508-11; Glasgow(GB) >The Election Problem in Asynchronous Distributed Systems with Bounded Faulty Processes
【24h】

The Election Problem in Asynchronous Distributed Systems with Bounded Faulty Processes

机译：有界故障过程的异步分布式系统的选举问题

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

摘要

Determining the "weakest" failure detectors is a central topic in solving many agreement problems such as Consensus, Non-Blocking Atomic Commit and Election in asynchronous distributed systems. So far, this has been studied extensively for several of such fundamental problems. It is stated that Perfect Failure Detector P is the weakest failure detector to solve the Election problem with any number of faulty processes. In this paper, we introduce Modal failure detector M and show that to solve Election, M is the weakest failure detector to solve election when the number of faulty processes is less than [n/2]. We also show that it is strictly weaker than P.
机译：在异步分布式系统中，确定“最弱”的故障检测器是解决许多协议问题（例如共识，无阻塞原子提交和选举）的中心主题。到目前为止，已经针对其中一些基本问题对此进行了广泛的研究。据指出，完美故障检测器P是解决任何数量的故障过程的选举问题的最弱的故障检测器。在本文中，我们介绍了模态故障检测器M并表明，对于故障选择，当故障过程数小于[n / 2]时，M是解决选举的最弱故障检测器。我们还表明，它比P严格弱。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号