On the Space Complexity of Set Agreement?

Abstract : The k-set agreement problem is a generalization of the classical consensus problem in which processes are permitted to output up to k different input values. In a system of n processes, an m-obstruction-free solution to the problem requires termination only in executions where the number of processes taking steps is eventually bounded by m. This family of progress conditions generalizes wait-freedom (m = n) and obstruction-freedom (m = 1). In this paper, we prove upper and lower bounds on the number of registers required to solve m-obstruction-free k-set agreement, considering both one-shot and repeated formulations. In particular, we show that repeated k set agreement can be solved using n + 2 m--k registers and establish a nearly matching lower bound of n + 2 m--k.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01251563
Contributor : Carole Delporte-Gallet <>
Submitted on : Wednesday, January 6, 2016 - 1:49:04 PM
Last modification on : Friday, January 4, 2019 - 5:33:21 PM

Identifiers

  • HAL Id : hal-01251563, version 1

Collections

Citation

Carole Delporte-Gallet, Hugues Fauconnier, Petr Kouznetsov, Eric Ruppert. On the Space Complexity of Set Agreement? . ACM Symposium on Principles of Distributed Computing, PODC 2015, Jul 2015, Donostia, France. ⟨hal-01251563⟩

Share

Metrics

Record views

183