TY - GEN
T1 - Lower bound on the step complexity of anonymous binary consensus
AU - Attiya, Hagit
AU - Ben-Baruch, Ohad
AU - Hendler, Danny
N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2016.
PY - 2016/1/1
Y1 - 2016/1/1
N2 - Obstruction-free consensus, ensuring that a process running solo will eventually terminate, is at the core of practical ways to solve consensus, e.g., by using randomization or failure detectors. An obstructionfree consensus algorithm may not terminate in many executions, but it must terminate whenever a process runs solo. Such an algorithm can be evaluated by its solo step complexity, which bounds the worst case number of steps taken by a process running alone, from any configuration, until it decides. This paper presents a lower bound of Ω(log n) on the solo step complexity of obstruction-free binary anonymous consensus. The proof constructs a sequence of executions in which more and more distinct variables are about to be written to, and then uses the backtracking covering technique to obtain a single execution in which many variables are accessed.
AB - Obstruction-free consensus, ensuring that a process running solo will eventually terminate, is at the core of practical ways to solve consensus, e.g., by using randomization or failure detectors. An obstructionfree consensus algorithm may not terminate in many executions, but it must terminate whenever a process runs solo. Such an algorithm can be evaluated by its solo step complexity, which bounds the worst case number of steps taken by a process running alone, from any configuration, until it decides. This paper presents a lower bound of Ω(log n) on the solo step complexity of obstruction-free binary anonymous consensus. The proof constructs a sequence of executions in which more and more distinct variables are about to be written to, and then uses the backtracking covering technique to obtain a single execution in which many variables are accessed.
UR - http://www.scopus.com/inward/record.url?scp=84988568875&partnerID=8YFLogxK
U2 - 10.1007/978-3-662-53426-7_19
DO - 10.1007/978-3-662-53426-7_19
M3 - منشور من مؤتمر
SN - 9783662534250
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 257
EP - 268
BT - Distributed Computing - 30th International Symposium, DISC 2016, Proceedings
A2 - Gavoille, Cyril
A2 - Ilcinkas, David
T2 - 30th International Symposium on Distributed Computing, DISC 2016
Y2 - 27 September 2016 through 29 September 2016
ER -