The inherent price of indulgence

被引：0
作者：
Partha Dutta
Rachid Guerraoui
机构：
[1] EPFL,Distributed Programming Laboratory
来源：
Distributed Computing | 2005年 / 18卷
关键词：
Fault tolerance; Distributed algorithms; Consensus time complexity;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
An indulgent algorithm is a distributed algorithm that tolerates asynchronous periods of the network when process crash detection is unreliable. This paper presents a tight bound on the time complexity of indulgent consensus algorithms.
引用
收藏
页码：85 / 98
页数：13
相关论文
共 19 条
[1]  
Aguilera M.K.(1999)A simple bivalency proof that Inform. Proces. Lett. 71 155-158
[2]  
Toueg S.(1996)-resilient consensus requires J. ACM 43 225-267
[3]  
Chandra T.D.(1988)+1 rounds J. ACM 35 288-323
[4]  
Toueg S.(1985)Unreliable failure detectors for reliable distributed systems J. ACM 32 374-382
[5]  
Dwork C.(1999)Consensus in the presence of partial synchrony Distribut. Comput. 12 209-223
[6]  
Lynch N.A.(2003)Impossibility of distributed consensus with one faulty process Inform. Process. Lett. 85 47-52
[7]  
Stockmeyer L.(1982)A simple and fast asynchronous consensus protocol based on a weak failure detector ACM Trans. Program. Languages Syst. 4 382-401
[8]  
Fischer M.J.(2001)A simple proof of the uniform consensus synchronous lower bound Parallel Proce. Lett. 11 95-107
[9]  
Lynch N.A.(undefined)The byzantine generals problem undefined undefined undefined-undefined
[10]  
Paterson M.S.(undefined)Leader-based consensus undefined undefined undefined-undefined
12