Enriching the reduction map of sub-consensus tasks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2011

Enriching the reduction map of sub-consensus tasks


Understanding the relative computability power of tasks, in the presence of asynchrony and failures, is a central concern of distributed computing theory. In the wait-free case, where the system consists of n processes and any of them can fail by crashing, substantial attention has been devoted to understanding the relative power of the subconsensus family of tasks, which are too weak to solve consensus for two processes. The first major results showed that set agreement and renaming (except for some particular values of n) cannot be solved wait-free in read/write memory. Then it was proved that renaming is strictly weaker than set agreement (when n is odd). This paper considers a natural family of subconsensus tasks that includes set agreement, renaming and other generalized symmetry breaking (GSB) tasks. It extends previous results, and proves various new results about when there is a reduction and when not, among these tasks. Among other results, the paper shows that there are incomparable subconsensus tasks.


Other [cs.OH]
Fichier principal
Vignette du fichier
PI-1976.pdf (275.06 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00591526 , version 1 (09-05-2011)


  • HAL Id : inria-00591526 , version 1


Armando Castañeda, Damien Imbs, Sergio Rajsbaum, Michel Raynal. Enriching the reduction map of sub-consensus tasks. [Research Report] PI-1976, 2011, pp.14. ⟨inria-00591526⟩
278 View
81 Download


Gmail Facebook X LinkedIn More