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

DOI10.1137/050645580MaRDI QIDQ3395045zbMATH OpenOpenAlexFDO

Authors Achour Mostefaoui, Sergio Rajsbaum, Michel Raynal, Corentin Travers

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

snapshotconsensusasynchronous systemshared memoryprocess 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)

Recommendations

• The combined power of conditions and failure detectors to solve asynchronous set agreement
• Failure detectors to solve asynchronous \(k\)-set agreement: a glimpse of recent results
• scientific article; zbMATH DE number 2013822
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• Simultaneous consensus vs set agreement: a message-passing-sensitive hierarchy of agreement problems
• The weakest failure detector for solving \(k\)-set agreement
• Randomized k-set agreement in crash-prone and Byzantine asynchronous systems

Cited in

(11)

• The combined power of conditions and failure detectors to solve asynchronous set agreement
• scientific article; zbMATH DE number 2013822 (Why is no real title available?)
• Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
• scientific article; zbMATH DE number 2013823 (Why is no real title available?)
• Perfect failure detection with very few bits
• Tight bounds for adopt-commit objects
• Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• Faster randomized consensus with an oblivious adversary
• Anonymous asynchronous systems: the case of failure detectors
• Communication patterns and input patterns in distributed computing (invited talk)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3395045)