Timeliness, failure-detectors, and consensus performance

We study the implication that various timeliness and failure detector assumptions have on the performance of consensus algorithms that exploit them. We present a general framework, GIRAF, for expressing such assumptions, and reasoning about the performance of indulgent algorithms. Categories and Subject Descriptors C.2.4 [Computer-Communication Networks]: Distributed Systems—Distributed applications General Terms Algorithms, Performance, Reliability, Theory Keywords Eventual synchrony, failure detectors, lower bounds, indulgent consensus.

• Type: Conference
• Year: 2006
• Where: PODC
• Authors: Idit Keidar, Alexander Shraer
• Keywords: Distributed And Parallel Computing, Failure Detector Assumptions, Failure Detectors, Indulgent Algorithms, PODC 2006