Set agreement and renaming in the presence of contention-related crash failures

Anaïs Durand, Michel Raynal, Gadi Taubenfeld

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


A new notion of process failure explicitly related to contention has recently been introduced by one of the authors (NETYS 2018). More precisely, given a predefined contention threshold λ, this notion considers the executions in which process crashes are restricted to occur only when process contention is smaller than or equal to λ. If crashes occur after contention bypassed λ, there are no correctness guarantees (e.g., termination is not guaranteed). It was shown that, when λ = n-1, consensus can be solved in an n-process asynchronous read/write system despite the crash of one process, thereby circumventing the well-known FLP impossibility result. Furthermore, it was shown that when λ = n-k and k≥2, k-set agreement can be solved despite the crash of 2k-2 processes. This paper considers two types of process crash failures: “ λ -constrained” crash failures (as previously defined), and classical crash failures (that we call “any time” failures). It presents two algorithms suited to these types of failures. The first algorithm solves k-set agreement, where k = m+f,, in the presence of t = 2m+f -1 crash failures, 2m of them being (n-k) -constrained failures, and (f-1) being any time failures. The second algorithm solves (n + f) -renaming in the presence of t = m + f crash failures, m of them being (n - t - 1) -constrained failures, and f being any time failures. It follows that the differentiation between λ -constrained crash failures and any time crash failures enlarges the space of executions in which the impossibility of k-set agreement and renaming in the presence of asynchrony and process crashes can be circumvented. In addition to its behavioral properties, both algorithms have a noteworthy first class property, namely, their simplicity.

Original languageEnglish
Title of host publicationStabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Proceedings
EditorsTaisuke Izumi, Petr Kuznetsov
PublisherSpringer Verlag
Number of pages15
ISBN (Print)9783030032319
StatePublished - 2018
Externally publishedYes
Event20th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2018 - Tokyo, Japan
Duration: 4 Nov 20187 Nov 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11201 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference20th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2018

Bibliographical note

Publisher Copyright:
© Springer Nature Switzerland AG 2018.


  • Agreement algorithm
  • Asynchronous system
  • Atomic register
  • Concurrency
  • Contention
  • Participating process
  • Process crash failure
  • Read/write register
  • Renaming
  • k-set agreement
  • l-mutual exclusion


Dive into the research topics of 'Set agreement and renaming in the presence of contention-related crash failures'. Together they form a unique fingerprint.

Cite this