More choices allow more faults: Set consensus problems in totally asynchronous systems
From MaRDI portal
Publication:1260652
DOI10.1006/INCO.1993.1043zbMATH Open0776.68016OpenAlexW1981017197MaRDI QIDQ1260652FDOQ1260652
Authors: Soma Chaudhuri 
Publication date: 30 August 1993
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1993.1043
Recommendations
- The combined power of conditions and failure detectors to solve asynchronous set agreement
- Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems
- Failure detectors to solve asynchronous \(k\)-set agreement: a glimpse of recent results
- The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement
- scientific article; zbMATH DE number 2013840
- Tight bounds for connectivity and set agreement in Byzantine synchronous systems
- The Election Problem in Asynchronous Distributed Systems with Bounded Faulty Processes
Cited In (80)
- A non-topological proof for the impossibility of \(k\)-set agreement
- Power and limits of distributed computing shared memory models
- The renaming problem in shared memory systems: an introduction
- Condition-based consensus solvability: a hierarchy of conditions and efficient protocols
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
- The combined power of conditions and failure detectors to solve asynchronous set agreement
- Objects shared by Byzantine processes
- Generalized Universality
- An impossibility about failure detectors in the iterated immediate snapshot model
- A topological treatment of early-deciding set-agreement
- Classifying rendezvous tasks of arbitrary dimension
- Collapsibility of read/write models using discrete Morse theory
- Stability of long-lived consensus.
- Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers
- The topology of look-compute-move robot wait-free algorithms with hard termination
- On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems
- On the computability power and the robustness of set agreement-oriented failure detector classes
- A note on atomicity: boosting Test\&Set to solve consensus
- Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures
- Hundreds of impossibility results for distributed computing
- On the uncontended complexity of anonymous agreement
- On the weakest failure detector ever
- Narrowing Power vs. Efficiency in Synchronous Set Agreement
- On Byzantine generals with alternative plans
- From binary consensus to multivalued consensus in asynchronous message-passing systems
- A classification of wait-free loop agreement tasks
- Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
- Recent results on fault-tolerant consensus in message-passing networks
- Structured Derivation of Semi-Synchronous Algorithms
- Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems
- The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement
- A necessary condition for Byzantine \(k\)-set agreement
- The Weakest Failure Detector for Message Passing Set-Agreement
- Title not available (Why is that?)
- Reaching consensus in the presence of contention-related crash failures
- Locality and checkability in wait-free computing
- Title not available (Why is that?)
- Distributed universality
- A necessary and sufficient condition for transforming limited accuracy failure detectors
- Reaching agreement in the presence of contention-related crash failures
- Linear space bootstrap communication schemes
- Synchronous condition-based consensus
- The complexity of early deciding set agreement: how can topology help?
- Closed schedulers: a novel technique for analyzing asynchronous protocols
- From wait-free to arbitrary concurrent solo executions in colorless distributed computing
- From adaptive renaming to set agreement
- Partial synchrony based on set timeliness
- New combinatorial topology bounds for renaming: the lower bound
- The Iterated Restricted Immediate Snapshot Model
- Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound
- Generalized symmetry breaking tasks and nondeterminism in concurrent objects
- The topology of distributed adversaries
- The disagreement power of an adversary
- Simultaneous consensus vs set agreement: a message-passing-sensitive hierarchy of agreement problems
- Life beyond set agreement
- Contention-related crash failures: definitions, agreement algorithms, and impossibility results
- On set consensus numbers
- The minimum information about failures for solving non-local tasks in message-passing systems
- Anti-\(\Omega \): the weakest failure detector for set agreement
- The BG distributed simulation algorithm
- The \(k\)-simultaneous consensus problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- The combinatorial structure of wait-free solvable tasks (extended abstract)
- Understanding the set consensus partial order using the Borowsky-Gafni simulation (extended abstract)
- Wait-free solvability of colorless tasks in anonymous shared-memory model
- Untangling partial agreement: iterated \(x\)-consensus simulations
- Optimal algorithms for synchronous Byzantine \(k\)-set agreement
- Optimal algorithms for synchronous Byzantine \(k\)-set agreement
- Wait-freedom with advice
- \(t\)-resilient immediate snapshot Is impossible
- Tasks in modular proofs of concurrent algorithms
- Algebraic topology and distributed computing
- Title not available (Why is that?)
- Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement
- An Introduction to the Topological Theory of Distributed Computing with Safe-consensus
- Tasks in modular proofs of concurrent algorithms
- Why Extension-Based Proofs Fail
- The solvability of consensus in iterated models extended with safe-consensus
- Of choices, failures and asynchrony: the many faces of set agreement
This page was built for publication: More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1260652)
