@inproceedings{484d170a92da4e3796dbb3efebd91d22,
title = "Fast scalable deterministic consensus for crash failures",
abstract = "We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaulty processes agree on a common value from among the input ones, after each process has been initialized with a binary input value. The system consists of n processes and it is assumed that at most t < n processes crash in an execution. A consensus algorithm that tolerates up to t failures is called fast when its time complexity is script O sign(t). All the previously known fast deterministic consensus solutions sent Ω(n2) bits in messages. We give a fast deterministic consensus algorithm that has processes send only script O sign(n log4 n) bits. In our solution, processes exchange messages according to topologies of overlay graphs that have suitable robustness and connectivity properties related to graph expansion.",
keywords = "Bit communication complexity, Consensus, Fault tolerance, Graph expansion, Message passing, Scalability, Synchrony",
author = "Chlebus, {Bogdan S.} and Kowalski, {Dariusz R.} and Micha{\l} Strojnowski",
year = "2009",
doi = "10.1145/1582716.1582738",
language = "English (US)",
isbn = "9781605583969",
series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",
pages = "111--120",
booktitle = "PODC'09 - Proceedings of the 2009 ACM Symposium on Principles of Distributed Computing",
note = "2009 ACM Symposium on Principles of Distributed Computing, PODC'09 ; Conference date: 10-08-2009 Through 12-08-2009",
}