Skip to main navigation Skip to search Skip to main content

Locally Solvable Tasks and the Limitations of Valency Arguments

Hagit Attiya, Armando Castañeda, Sergio Rajsbaum

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

An elegant strategy for proving impossibility results in distributed computing was introduced in the celebrated FLP consensus impossibility proof. This strategy is local in nature as at each stage, one configuration of a hypothetical protocol for consensus is considered, together with future valencies of possible extensions. This proof strategy has been used in numerous situations related to consensus, leading one to wonder why it has not been used in impossibility results of two other well-known tasks: set agreement and renaming. This paper provides an explanation of why impossibility proofs of these tasks have been of a global nature. It shows that a protocol can always solve such tasks locally, in the following sense. Given a configuration and all its future valencies, if a single successor configuration is selected, then the protocol can reveal all decisions in this branch of executions, satisfying the task specification. This result is shown for both set agreement and renaming, implying that there are no local impossibility proofs for these tasks.

Original languageEnglish
Title of host publication24th International Conference on Principles of Distributed Systems, OPODIS 2020
EditorsQuentin Bramas, Rotem Oshman, Paolo Romano
ISBN (Electronic)9783959771764
DOIs
StatePublished - Jan 2021
Event24th International Conference on Principles of Distributed Systems, OPODIS 2020 - Virtual, Online, France
Duration: 14 Dec 202016 Dec 2020

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume184

Conference

Conference24th International Conference on Principles of Distributed Systems, OPODIS 2020
Country/TerritoryFrance
CityVirtual, Online
Period14/12/2016/12/20

Keywords

  • Impossibility proofs
  • Set agreement
  • Wait-freedom
  • Weak symmetry breaking

All Science Journal Classification (ASJC) codes

  • Software

Cite this