Robust gossiping with an application to consensus

Bogdan S. Chlebus, Dariusz R. Kowalski

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish (US)
Pages (from-to)1262-1281
Number of pages20
JournalJournal of Computer and System Sciences
Volume72
Issue number8
DOIs
StatePublished - Dec 1 2006
Externally publishedYes

Fingerprint

Gossiping
Crash
Communication
Synchronous Systems
Gossip
Trade-offs

Keywords

  • Consensus
  • Crash failure
  • Distributed algorithm
  • Gossiping
  • Message passing
  • Synchrony

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Networks and Communications
  • Computational Theory and Mathematics
  • Applied Mathematics

Cite this

Robust gossiping with an application to consensus. / Chlebus, Bogdan S.; Kowalski, Dariusz R.

In: Journal of Computer and System Sciences, Vol. 72, No. 8, 01.12.2006, p. 1262-1281.

Research output: Contribution to journalArticle

Chlebus, Bogdan S. ; Kowalski, Dariusz R. / Robust gossiping with an application to consensus. In: Journal of Computer and System Sciences. 2006 ; Vol. 72, No. 8. pp. 1262-1281.
@article{6268e07a81554fedbfb7de9313a20766,
title = "Robust gossiping with an application to consensus",
abstract = "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.",
keywords = "Consensus, Crash failure, Distributed algorithm, Gossiping, Message passing, Synchrony",
author = "Chlebus, {Bogdan S.} and Kowalski, {Dariusz R.}",
year = "2006",
month = "12",
day = "1",
doi = "10.1016/j.jcss.2006.08.001",
language = "English (US)",
volume = "72",
pages = "1262--1281",
journal = "Journal of Computer and System Sciences",
issn = "0022-0000",
publisher = "Academic Press Inc.",
number = "8",

}

TY - JOUR

T1 - Robust gossiping with an application to consensus

AU - Chlebus, Bogdan S.

AU - Kowalski, Dariusz R.

PY - 2006/12/1

Y1 - 2006/12/1

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

VL - 72

SP - 1262

EP - 1281

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

SN - 0022-0000

IS - 8

ER -