@inproceedings{0111d29db9f5419984b0a4e916ec075c,
title = "Quick atomic broadcast",
abstract = "In Atomic Broadcast protocols, the participating processors may initiate the broadcast of a message at any time; the goal is to make all non-faulty processors deliver the same set of messages in the same order. Our objective in this paper is to assure that the delivery time (from the moment of initiation of a message to its last delivery by a correct processor) is proportional to the actual number of faults in a given run of the protocol. We study this problem in synchronous systems and two models of semi-synchronous systems in presence of various classes of processor failures. We offer a technique that allows to convert “early stopping” Distributed Consensus protocols to Atomic Broadcast protocols with the above property. The resulting Atomic Broadcast protocols are faster and use smaller messages than the protocols proposed so far.",
author = "Piotr Berman and Bharali, {Anupam A.}",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1993.; 7th International Workshop on Distributed Algorithms, WDAG 1993 ; Conference date: 27-09-1993 Through 29-09-1993",
year = "1993",
doi = "10.1007/3-540-57271-6_36",
language = "English (US)",
isbn = "9783540572718",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "189--203",
editor = "Andre Schipe",
booktitle = "Distributed Algorithms - 7th International Workshop, WDAG 1993, Proceedings",
address = "Germany",
}