在不了解每个人的情况下达成协议:走向活力的第一步

NOuvelles TEchnologies de la REpartition Pub Date : 2008-06-23 DOI:10.1145/1416729.1416792

Mohssen Abboud, C. Delporte-Gallet, H. Fauconnier

{"title":"在不了解每个人的情况下达成协议:走向活力的第一步","authors":"Mohssen Abboud, C. Delporte-Gallet, H. Fauconnier","doi":"10.1145/1416729.1416792","DOIUrl":null,"url":null,"abstract":"We study in this paper the consensus problem in asynchronous models where the set of participating processes is not known. We prove that in this model the consensus is impossible to be solved even if no process may crash. We prove that the asynchronous model augmented with failure detector Σ, which enables to realize a quorum, is sufficient to circumvent this impossibility result. For this, we present an algorithm solving the consensus problem in this model.","PeriodicalId":321308,"journal":{"name":"NOuvelles TEchnologies de la REpartition","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Agreement without knowing everybody: a first step to dynamicity\",\"authors\":\"Mohssen Abboud, C. Delporte-Gallet, H. Fauconnier\",\"doi\":\"10.1145/1416729.1416792\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study in this paper the consensus problem in asynchronous models where the set of participating processes is not known. We prove that in this model the consensus is impossible to be solved even if no process may crash. We prove that the asynchronous model augmented with failure detector Σ, which enables to realize a quorum, is sufficient to circumvent this impossibility result. For this, we present an algorithm solving the consensus problem in this model.\",\"PeriodicalId\":321308,\"journal\":{\"name\":\"NOuvelles TEchnologies de la REpartition\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-06-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"NOuvelles TEchnologies de la REpartition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1416729.1416792\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"NOuvelles TEchnologies de la REpartition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1416729.1416792","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

本文研究了异步模型中参与进程集合未知的一致性问题。我们证明了在这个模型中，即使没有进程可能崩溃，共识也不可能被解决。我们证明了增加故障检测器Σ的异步模型能够实现仲裁，足以避免这种不可能的结果。为此，我们提出了一种算法来解决该模型中的一致性问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Agreement without knowing everybody: a first step to dynamicity

We study in this paper the consensus problem in asynchronous models where the set of participating processes is not known. We prove that in this model the consensus is impossible to be solved even if no process may crash. We prove that the asynchronous model augmented with failure detector Σ, which enables to realize a quorum, is sufficient to circumvent this impossibility result. For this, we present an algorithm solving the consensus problem in this model.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

NOuvelles TEchnologies de la REpartition

自引率

0.00%

发文量