TY - GEN
T1 - Simple constant-time consensus protocols in realistic failure models (extended abstract)
AU - Chor, Benny
AU - Merritt, Michael
AU - Shmoys, David B.
N1 - Publisher Copyright:
© 1985 ACM.
PY - 1985/8/1
Y1 - 1985/8/1
N2 - Using simple and elegant protocols, we show how to achieve consensus in constant expected time, within realistic failure models. Significantly, the strongest models considered are completely asynchronous. A nearly matching lower bound is also given.
AB - Using simple and elegant protocols, we show how to achieve consensus in constant expected time, within realistic failure models. Significantly, the strongest models considered are completely asynchronous. A nearly matching lower bound is also given.
UR - http://www.scopus.com/inward/record.url?scp=84947960569&partnerID=8YFLogxK
U2 - 10.1145/323596.323610
DO - 10.1145/323596.323610
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84947960569
T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
SP - 152
EP - 162
BT - Proceedings of the 4th Annual ACM Symposium on Principles of Distributed Computing, PODC 1985
A2 - Strong, Ray
A2 - Malcolm, Michael
PB - Association for Computing Machinery
T2 - 4th Annual ACM Symposium on Principles of Distributed Computing, PODC 1985
Y2 - 5 August 1985 through 7 August 1985
ER -