TY - JOUR
T1 - Robust gossiping with an application to consensus
AU - Chlebus, Bogdan S.
AU - Kowalski, Dariusz R.
N1 - Funding Information:
✩ A preliminary version of this paper appeared as “Gossiping to reach consensus” in Proceedings of the 14th ACM Symposium on Parallel Algorithms and Architectures, Winnipeg, Manitoba, Canada, 2002, pp. 220–229. * Corresponding author. E-mail address: bogdan.chlebus@cudenver.edu (B.S. Chlebus). 1 The research of this author was supported by NSF Grant 0310503.
PY - 2006/12
Y1 - 2006/12
N2 - We study deterministic gossiping in synchronous systems with dynamic crash failures. Each processor is initialized with an input value called rumor. In the standard gossip problem, the goal of every processor is to learn all the rumors. When processors may crash, then this goal needs to be revised, since it is possible, at a point in an execution, that certain rumors are known only to processors that have already crashed. We define gossiping to be completed, for a system with crashes, when every processor knows either the rumor of processor v or that v has already crashed, for any processor v. We design gossiping algorithms that are efficient with respect to both time and communication. Let t < n be the number of failures, where n is the number of processors. If n - t = Ω (n / polylog n), then one of our algorithms completes gossiping in O (log2 t) time and with O (n polylog n) messages. We develop an algorithm that performs gossiping with O (n1.77) messages and in O (log2 n) time, in any execution in which at least one processor remains non-faulty. We show a trade-off between time and communication in gossiping algorithms: if the number of messages is at most O (n polylog n), then the time has to be at least Ω (frac(log n, log (n log n) - log t)). By way of application, we show that if n - t = Ω (n), then consensus can be solved in O (t) time and with O (n log2 t) messages.
AB - We study deterministic gossiping in synchronous systems with dynamic crash failures. Each processor is initialized with an input value called rumor. In the standard gossip problem, the goal of every processor is to learn all the rumors. When processors may crash, then this goal needs to be revised, since it is possible, at a point in an execution, that certain rumors are known only to processors that have already crashed. We define gossiping to be completed, for a system with crashes, when every processor knows either the rumor of processor v or that v has already crashed, for any processor v. We design gossiping algorithms that are efficient with respect to both time and communication. Let t < n be the number of failures, where n is the number of processors. If n - t = Ω (n / polylog n), then one of our algorithms completes gossiping in O (log2 t) time and with O (n polylog n) messages. We develop an algorithm that performs gossiping with O (n1.77) messages and in O (log2 n) time, in any execution in which at least one processor remains non-faulty. We show a trade-off between time and communication in gossiping algorithms: if the number of messages is at most O (n polylog n), then the time has to be at least Ω (frac(log n, log (n log n) - log t)). By way of application, we show that if n - t = Ω (n), then consensus can be solved in O (t) time and with O (n log2 t) messages.
KW - Consensus
KW - Crash failure
KW - Distributed algorithm
KW - Gossiping
KW - Message passing
KW - Synchrony
UR - http://www.scopus.com/inward/record.url?scp=33750458693&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33750458693&partnerID=8YFLogxK
U2 - 10.1016/j.jcss.2006.08.001
DO - 10.1016/j.jcss.2006.08.001
M3 - Article
AN - SCOPUS:33750458693
SN - 0022-0000
VL - 72
SP - 1262
EP - 1281
JO - Journal of Computer and System Sciences
JF - Journal of Computer and System Sciences
IS - 8
ER -