@inproceedings{1fcc9a83bd084a529e060996106c7500,
title = "Clairvoyant state machine replications",
abstract = "We propose a new protocol for the generalized consensus problem in asynchronous systems subject to Byzantine server failures. The protocol solves the consensus problem in a setting in which information about conflict between transactions is available (such information can be in the form of transaction read and write sets). The use of non-skipping timestamps permits servers to commit transactions as soon as they know that no conflicting transaction can be ordered earlier. Unlike most prior proposals (for generalized or classical consensus), which use a leader to order transactions, this protocol is leaderless, and relies on non-skipping timestamps for transaction ordering. Being leaderless, the protocol does not need to pause for leader elections. For n servers of which f may be faulty, this protocol requires n>4f.",
author = "Rida Bazzi and Maurice Herlihy",
year = "2018",
month = jan,
day = "1",
doi = "10.1007/978-3-030-03232-6_17",
language = "English (US)",
isbn = "9783030032319",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "254--268",
editor = "Taisuke Izumi and Petr Kuznetsov",
booktitle = "Stabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Proceedings",
note = "20th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2018 ; Conference date: 04-11-2018 Through 07-11-2018",
}