Achievable cases in an asynchronous environment

H. Attiya, A. Bar-Noy, D. Dolev, D. Koller, D. Peleg, R. Reischuk
{"title":"Achievable cases in an asynchronous environment","authors":"H. Attiya, A. Bar-Noy, D. Dolev, D. Koller, D. Peleg, R. Reischuk","doi":"10.1109/SFCS.1987.5","DOIUrl":null,"url":null,"abstract":"The paper deals with achievability of fault tolerant goals in a completely asynchronous distributed system. Fischer, Lynch, and Paterson [FLP] proved that in such a system \"nontrivial agreement\" cannot be achieved even in the (possible) presence of a single \"benign\" fault. In contrast, we exhibit two pairs of goals that are achievable even in the presence of up to t ≪ n/2 faulty processors, contradicting the widely held assumption that no nontrivial goals are attainable in such a system. The first pair deals with renaming processors so as to reduce the size of the initial name space. When only uniqueness is required of the new names, we present a lower bound of n + 1 on the size of the new name space, and a renaming algorithm which establishes an upper bound of n + t. In case the new names are required also to preserve the original order, a tight bound of 2t(n- t + 1) - 1 is obtained. The second pair of goals deals with the multi-slot critical section problem. We present algorithms for controlled access to a critical section. As for the number of slots required, a tight bound of t + 1 is proved in case the slots are identical. In the case of distinct slots the upper bound is 2t + 1.","PeriodicalId":153779,"journal":{"name":"28th Annual Symposium on Foundations of Computer Science (sfcs 1987)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1987-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"87","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"28th Annual Symposium on Foundations of Computer Science (sfcs 1987)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1987.5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 87

Abstract

The paper deals with achievability of fault tolerant goals in a completely asynchronous distributed system. Fischer, Lynch, and Paterson [FLP] proved that in such a system "nontrivial agreement" cannot be achieved even in the (possible) presence of a single "benign" fault. In contrast, we exhibit two pairs of goals that are achievable even in the presence of up to t ≪ n/2 faulty processors, contradicting the widely held assumption that no nontrivial goals are attainable in such a system. The first pair deals with renaming processors so as to reduce the size of the initial name space. When only uniqueness is required of the new names, we present a lower bound of n + 1 on the size of the new name space, and a renaming algorithm which establishes an upper bound of n + t. In case the new names are required also to preserve the original order, a tight bound of 2t(n- t + 1) - 1 is obtained. The second pair of goals deals with the multi-slot critical section problem. We present algorithms for controlled access to a critical section. As for the number of slots required, a tight bound of t + 1 is proved in case the slots are identical. In the case of distinct slots the upper bound is 2t + 1.
异步环境中可实现的用例
本文研究了完全异步分布式系统中容错目标的可实现性。Fischer, Lynch和Paterson [FLP]证明,在这样一个系统中,即使(可能)存在单个“良性”错误,也无法实现“非平凡协议”。相反,我们展示了两对即使在存在高达1≪n/2个故障处理器的情况下也能实现的目标,这与人们普遍认为在这样的系统中不可能实现重要目标的假设相矛盾。第一对处理重命名处理器,以减少初始名称空间的大小。当只要求新名称的唯一性时,我们给出了新名称空间大小的下界n + 1,并给出了一种重命名算法,该算法建立了n + t的上界。当新名称也要求保持原顺序时,我们得到了2t(n- t + 1) - 1的紧界。第二对目标处理多槽临界截面问题。我们提出了一种临界区域的控制访问算法。对于所需槽位数,在槽位相同的情况下,证明了t + 1的紧界。在不同槽的情况下上界是2t + 1。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信