The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement

DOI10.1137/050645580zbMath1192.68278OpenAlexW2051583793MaRDI QIDQ3395045

Corentin Travers, Sergio Rajsbaum, Michel Raynal, Achour Mostefaoui

Publication date: 20 August 2009

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/050645580

zbMATH Keywords

snapshotshared memoryconsensusasynchronous systemprocess crashset agreementfailure detectionconditioninput vectorlegal condition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (6)

Communication Patterns and Input Patterns in Distributed Computing ⋮ Anonymous asynchronous systems: the case of failure detectors ⋮ Tight bounds for adopt-commit objects ⋮ Faster randomized consensus with an oblivious adversary ⋮ Perfect failure detection with very few bits ⋮ Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound

This page was built for publication: The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement