research-article

On the Space Complexity of Set Agreement

Authors:

Carole Delporte-Gallet,

Hugues Fauconnier,

Petr Kuznetsov,

Eric RuppertAuthors Info & Claims

PODC '15: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing

Pages 271 - 280

https://doi.org/10.1145/2767386.2767406

Published: 21 July 2015 Publication History

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.

References

[1]

Yehuda Afek, Hagit Attiya, Danny Dolev, Eli Gafni, Michael Merritt, and Nir Shavit. Atomic snapshots of shared memory. Journal of the ACM, 40(4):873--890, September 1993.

Digital Library

[2]

Elizabeth Borowsky and Eli Gafni. Generalized FLP impossibility result for $t$-resilient asynchronous computations. In Proc. 25th ACM Symposium on Theory of Computing, pages 91--100, 1993.

Digital Library

[3]

Soma Chaudhuri. More choices allow more faults: Set consensus problems in totally asynchronous systems. Information and Computation, 105(1):132--158, July 1993.

Digital Library

[4]

Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, and Sergio Rajsbaum. Black art: Obstruction-free k-set agreement with |MWMR registers|<|proccesses|. In Proc. 1st International Conference on Networked Systems, volume 7853 of LNCS, pages 28--41, 2013.

[5]

Carole Delporte-Gallet, Hugues Fauconnier, Petr Kuznetsov, and Eric Ruppert. On the space complexity of set agreement. CoRR, abs/1505.02690, 2015.

[6]

Faith Ellen, Panagiota Fatourou, and Eric Ruppert. Time lower bounds for implementations of multi-writer snapshots. Journal of the ACM, 54(6), December 2007.

Digital Library

[7]

Faith Ellen Fich, Maurice Herlihy, and Nir Shavit. On the space complexity of randomized synchronization. Journal of the ACM, 45(5):843--862, September 1998.

Digital Library

[8]

Rachid Guerraoui and Eric Ruppert. Anonymous and fault-tolerant shared-memory computing. Distributed Computing, 20(3):165--177, October 2007.

Digital Library

[9]

Maurice Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124--149, January 1991.

Digital Library

[10]

Maurice Herlihy, Victor Luchangco, and Mark Moir. Obstruction-free synchronization: Double-ended queues as an example. In Proc. 23rd International Conference on Distributed Computing Systems, pages 522--529, 2003.

Digital Library

[11]

Maurice Herlihy and Nir Shavit. The topological structure of asynchronous computability. Journal of the ACM, 46(6):858--923, November 1999.

Digital Library

[12]

Michael Saks and Fotios Zaharoglou. Wait-free k-set agreement is impossible: The topology of public knowledge. SIAM Journal on Computing, 29(5):1449--1483, 2000.

Digital Library

[13]

Gadi Taubenfeld. Contention-sensitive data structures and algorithms. In Proc.\ 23rd International Symposium on Distributed Computing, volume 5805 of LNCS, pages 157--171, 2009.

Digital Library

[14]

Paul M. B. Vitányi and Baruch Awerbuch. Atomic shared register access by asynchronous hardware. In Proc. 27th Symposium on Foundations of Computer Science, pages 233--243, 1986.

Digital Library

[15]

Jiong Yang, Gil Neiger, and Eli Gafni. Structured derivations of consensus algorithms for failure detectors. In Proc. 17th ACM Symposium on Principles of Distributed Computing, pages 297--306, 1998.

Digital Library

Cited By

Ovens S(2024)The Space Complexity of Consensus from SwapJournal of the ACM10.1145/363139071:1(1-26)Online publication date: 11-Feb-2024
https://dl.acm.org/doi/10.1145/3631390
Ellen FGelashvili RZhu LNewport CKeidar I(2018)Revisionist SimulationsProceedings of the 2018 ACM Symposium on Principles of Distributed Computing10.1145/3212734.3212749(61-70)Online publication date: 23-Jul-2018
https://dl.acm.org/doi/10.1145/3212734.3212749
Bouzid ZRaynal MSutra P(2018)Anonymous obstruction-free (n, k)-set agreement with $$n-k+1$$n-k+1 atomic read/write registersDistributed Computing10.1007/s00446-017-0301-731:2(99-117)Online publication date: 1-Apr-2018
https://dl.acm.org/doi/10.1007/s00446-017-0301-7
Show More Cited By

Index Terms

On the Space Complexity of Set Agreement
1. Software and its engineering
  1. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Process management
        Concurrency control
        Multiprocessing / multiprogramming / multitasking
        Process synchronization
2. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Easy impossibility proofs for k-set agreement in message passing systems
OPODIS'11: Proceedings of the 15th international conference on Principles of Distributed Systems

Despite of being quite similar (agreement) problems, 1-set agreement (consensus) and general k-set agreement require surprisingly different techniques for proving the impossibility in asynchronous systems with crash failures: Rather than the relatively ...
Randomized k-set agreement
SPAA '01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures

The k-Set Agreement problem generalizes the consensus problem (which corresponds to the case k = 1). The processes propose values and each correct process has to decide a value such that (1) a decided value is a proposed value, and (2) no more than k ...
A tight lower bound for k-set agreement
SFCS '93: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science

We prove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where processors fail by crashing. We prove a lower bound of [f/k]+1 rounds of ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODC '15: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing

July 2015

508 pages

ISBN:9781450336178

DOI:10.1145/2767386

General Chair:
Chryssis Georgiou
University of Cyprus, Cyprus
,
Program Chair:
Paul G. Spirakis
University of Liverpool, UK & CTI, Greece

Copyright © 2015 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 July 2015

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Agence Nationale de la Recherche (France)
Fondation Sciences Mathématiques de Paris and the Natural Sciences and Engineering Research Council of Canada

Conference

PODC '15

Sponsor:

PODC '15: ACM Symposium on Principles of Distributed Computing

July 21 - 23, 2015

Donostia-San Sebastián, Spain

Acceptance Rates

PODC '15 Paper Acceptance Rate 45 of 191 submissions, 24%;

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
149
Total Downloads

Downloads (Last 12 months)6
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Ovens S(2024)The Space Complexity of Consensus from SwapJournal of the ACM10.1145/363139071:1(1-26)Online publication date: 11-Feb-2024
https://dl.acm.org/doi/10.1145/3631390
Ellen FGelashvili RZhu LNewport CKeidar I(2018)Revisionist SimulationsProceedings of the 2018 ACM Symposium on Principles of Distributed Computing10.1145/3212734.3212749(61-70)Online publication date: 23-Jul-2018
https://dl.acm.org/doi/10.1145/3212734.3212749
Bouzid ZRaynal MSutra P(2018)Anonymous obstruction-free (n, k)-set agreement with $$n-k+1$$n-k+1 atomic read/write registersDistributed Computing10.1007/s00446-017-0301-731:2(99-117)Online publication date: 1-Apr-2018
https://dl.acm.org/doi/10.1007/s00446-017-0301-7
Capdevielle CJohnen CKuznetsov PMilani A(2017)On the uncontended complexity of anonymous agreementDistributed Computing10.1007/s00446-017-0297-z30:6(459-468)Online publication date: 1-Dec-2017
https://dl.acm.org/doi/10.1007/s00446-017-0297-z

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten