Summary: Lower Bounds for Randomized Consensus
under a Weak Adversary
Hagit Attiya
Department of Computer
Science, Technion
Haifa, Israel
hagit@cs.technion.ac.il
Keren Censor
Department of Computer
Science, Technion
Haifa, Israel
ckeren@cs.technion.ac.il
ABSTRACT
This paper studies the inherent trade-off between termina-
tion probability and total step complexity of randomized
consensus algorithms. It shows that for every integer k,
the probability that an f-resilient randomized consensus al-
gorithm of n processes does not terminate with agreement
within k(n - f) steps is at least 1
ck , for some constant c.

Source: Attiya, Hagit - Department of Computer Science, Technion, Israel Institute of Technology

Collections: Computer Technologies and Information Sciences