Impossibility of distributed consensus with one faulty process
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- A topological treatment of early-deciding set-agreement
- Rapid almost-complete broadcasting in faulty networks
- Classifying rendezvous tasks of arbitrary dimension
- Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound
- A bivalency proof of the lower bound for uniform consensus
- How to cope with faulty processors in a completely connected network of communicating processors
- Easy impossibility proofs for distributed consensus problems
- How processes learn
- Stopping times of distributed consensus protocols: a probabilistic analysis
- Asynchronous byzantine agreement protocols
- Optimal fault-tolerant distributed construction of a spanning forest
- Fault-tolerant critical section management in asynchronous environments
- Efficient parallel algorithms can be made robust
- Machine checked proofs of the design of a fault-tolerant circuit
- Fast information sharing in a complete network
- Space-efficient asynchronous consensus without shared memory initialization
- Some impossibility results in interprocess synchronization
- Reducing to W
- Increasing the resilience of distributed and replicated database systems
- Consensus under unreliable transmission
- Using the heartbeat failure detector for quiescent reliable communication and consensus in partitionable networks
- Using knowledge to optimally achieve coordination in distributed systems
- Wait-free implementations in message-passing systems
- Knowledge in shared memory systems.
- Necessary and sufficient conditions for broadcast consensus protocols.
- Distributed consensus revisited
- Reliability versus cost: Design of a probabilistic broadcast algorithm
- Efficient execution of nondeterministic parallel programs on asynchronous systems
- A computer scientist looks at game theory.
- On modelling mobility
- Choosing social laws for multi-agent systems: Minimality and simplicity
- Revisiting the PAXOS algorithm
- Asynchronous process calculi: The first- and higher-order paradigms
- Restricted failure detectors: Definition and reduction protocols
- Collapsibility of read/write models using discrete Morse theory
- Consensus-based modeling using distributed feature construction with ILP
- Geometric and combinatorial views on asynchronous computability
- In search of lost time
- On the uncontended complexity of anonymous agreement
- Randomized k-set agreement in crash-prone and Byzantine asynchronous systems
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
- Anonymous obstruction-free (n,k)-set agreement with n-k+1 atomic read/write registers
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
- A simple proof of a simple consensus algorithm
- Leader election in the presence of n-1 initial failures
- Exact communication costs for consensus and leader in a tree
- Consensus in Byzantine asynchronous systems
- A simple proof of the uniform consensus synchronous lower bound.
- Byzantine-resistant total ordering algorithms.
- The power of multiobjects.
- Computing in totally anonymous asynchronous shared memory systems
- A classification of wait-free loop agreement tasks
- Optimistic atomic broadcast: A pragmatic viewpoint
- A necessary and sufficient condition for transforming limited accuracy failure detectors
- Abstractions for fault-tolerant global computing
- Possibility and impossibility results in a shared memory environment
- A modular approach to shared-memory consensus, with applications to the probabilistic-write model
- Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
- Failure detectors encapsulate fairness
- The correctness proof of Ben-Or's randomized consensus algorithm
- Renaming and the weakest family of failure detectors
- Communication-efficient and crash-quiescent omega with unknown membership
- Communication-efficient failure detection and consensus in omission environments
- Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler
- A knowledge-theoretic analysis of uniform distributed coordination and failure detectors
- Low complexity Byzantine-resilient consensus
- Active disk Paxos with infinitely many processes
- The inherent price of indulgence
- Tight bounds for shared memory systems accessed by Byzantine processes
- Fast Paxos
- Lower bounds for asynchronous consensus
- The weakest failure detector to solve nonuniform consensus
- The overhead of consensus failure recovery
- The doomsday distributed termination detection protocol
- The design of novel distributed protocols from differential equations
- Failure detectors as type boosters
- Renaming in synchronous message passing systems with Byzantine failures
- The weakest failure detectors to boost obstruction-freedom
- When consensus meets self-stabilization
- Byzantine-tolerant causal broadcast
- The computational structure of progress conditions and shared objects
- The topology of look-compute-move robot wait-free algorithms with hard termination
- Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures
- Making asynchronous distributed computations robust to noise
- Consensus in rooted dynamic networks with short-lived stability
- The weakest failure detector for eventual consistency
- Reaching approximate Byzantine consensus with multi-hop communication
- Towards a universal approach for the finite departure problem in overlay networks
- A simple Byzantine generals protocol
- A simplicial complex model for dynamic epistemic logic to study distributed task computability
- A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks
- Communication-efficient randomized consensus
- Contention-related crash failures: definitions, agreement algorithms, and impossibility results
- Asynchronous reconfiguration with Byzantine failures
- Making Byzantine consensus live
- The epigenetic consensus problem
- The consensus number of a cryptocurrency
- On atomic registers and randomized consensus in m\&m systems
- Unbeatable consensus
- Clairvoyant state machine replication
This page was built for publication: Impossibility of distributed consensus with one faulty process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3766835)
