The weakest failure detector for solving consensus
From MaRDI portal
Recommendations
- The weakest failure detector for solving consensus
- The weakest failure detector to solve nonuniform consensus
- The weakest failure detector to solve nonuniform consensus
- A weakest failure detector-based asynchronous consensus protocol for \(f<n\)
- The weakest failure detector for eventual consistency
- The weakest failure detector for eventual consistency
- The weakest failure detector for solving k-set agreement
- The weakest failure detectors to solve certain fundamental problems in distributed computing
- Early consensus in an asynchronous system with a weak failure detector
- Failure Detection and Randomization: A Hybrid Approach to Solve Consensus
Cited in
(only showing first 100 items - show all)- Anti-\(\Omega \): the weakest failure detector for set agreement
- Randomized protocols for asynchronous consensus
- The missing piece: a distributed system-level diagnosis model for the implementation of unreliable failure detectors
- Genuine atomic multicast in asynchronous distributed systems
- The DHCP Failover Protocol: A Formal Perspective
- Power and limits of distributed computing shared memory models
- The weakest failure detector to implement a register in asynchronous systems with hybrid communication
- Byzantine-resistant total ordering algorithms.
- Characterizing Consensus in the Heard-Of Model
- On modelling mobility
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
- On implementing omega in systems with weak reliability and synchrony assumptions
- Non-blocking atomic commit in asynchronous distributed systems with failure detectors
- Making Byzantine consensus live
- Making Byzantine consensus live
- Automated test case generation for the paxos single-decree protocol using a coloured Petri net model
- Distributed consensus, revisited
- Multi-shot distributed transaction commit
- Open consensus
- Multi-shot distributed transaction commit
- An impossibility about failure detectors in the iterated immediate snapshot model
- A knowledge-theoretic analysis of uniform distributed coordination and failure detectors
- Asynchronous bounded lifetime failure detectors
- Anonymous obstruction-free (n,k)-set agreement with n-k+1 atomic read/write registers
- Randomization and failure detection: a hybrid approach to solve consensus
- Managed agreement: generalizing two fundamental distributed agreement problems
- A timing assumption and two \(t\)-resilient protocols for Implementing an eventual leader service in asynchronous shared memory systems
- The impossibility of boosting distributed service resilience
- On the road to the weakest failure detector for k-set agreement in message-passing systems
- Abstractions for fault-tolerant global computing
- Fair Exchange Is Incomparable to Consensus
- On the computability power and the robustness of set agreement-oriented failure detector classes
- The weakest failure detector for eventual consistency
- Consensus in the presence of mortal Byzantine faulty processes
- On the weakest failure detector ever
- Hundreds of impossibility results for distributed computing
- A simple and communication-efficient omega algorithm in the crash-recovery model
- Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links
- Adaptive progress: a gracefully-degrading liveness property
- Using asynchrony and zero degradation to speed up indulgent consensus protocols
- From binary consensus to multivalued consensus in asynchronous message-passing systems
- Early consensus in an asynchronous system with a weak failure detector
- Practically-self-stabilizing virtual synchrony
- Consensus in anonymous asynchronous systems with crash-recovery and omission failures
- On the importance of having an identity or, is consensus really universal?
- Using the heartbeat failure detector for quiescent reliable communication and consensus in partitionable networks
- Consensus in Data Management: From Distributed Commit to Blockchain
- Wait-freedom with advice
- The Weakest Failure Detector for Message Passing Set-Agreement
- Byzantine disk paxos: optimal resilience with Byzantine shared memory
- The Heard-Of model: computing in distributed systems with benign faults
- t-resilient immediate snapshot Is impossible
- In search of lost time
- Failure detectors as type boosters
- Tight bounds for k-set agreement with limited-scope failure detectors
- Fault tolerant network constructors
- Creek: a single-order mixed-consistency replication scheme
- Revisiting the PAXOS algorithm
- Consensus in Byzantine asynchronous systems
- About informatics, distributed computing, and our job: a personal view
- A necessary and sufficient condition for transforming limited accuracy failure detectors
- Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks
- On the hardness of failure-sensitive agreement problems.
- A flexible formal framework for masking/demasking faults
- Communication-optimal eventually perfect failure detection in partially synchronous systems
- Perfect failure detection with very few bits
- A distributed leader election algorithm in crash-recovery and omissive systems
- Self-stabilizing indulgent zero-degrading binary consensus
- From adaptive renaming to set agreement
- Failure detectors encapsulate fairness
- Partial synchrony based on set timeliness
- Renaming and the weakest family of failure detectors
- Communication-efficient and crash-quiescent omega with unknown membership
- Agreeing within a few writes
- The Iterated Restricted Immediate Snapshot Model
- Implementing unreliable failure detectors with unknown membership
- Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures
- A simple and fast asynchronous consensus protocol based on a weak failure detector
- scientific article; zbMATH DE number 2013834 (Why is no real title available?)
- How to Solve Consensus in the Smallest Window of Synchrony
- Anonymous asynchronous systems: the case of failure detectors
- Active disk Paxos with infinitely many processes
- Low-latency atomic broadcast in the presence of contention
- The weakest failure detector to solve nonuniform consensus
- Reducing to W
- Implementing the Omega failure detector in the crash-recovery failure model
- The weakest failure detector to solve nonuniform consensus
- Communication patterns and input patterns in distributed computing (invited talk)
- The gap in circumventing the impossibility of consensus
- The disagreement power of an adversary
- Simultaneous consensus vs set agreement: a message-passing-sensitive hierarchy of agreement problems
- On set consensus numbers
- Contention-related crash failures: definitions, agreement algorithms, and impossibility results
- The minimum information about failures for solving non-local tasks in message-passing systems
- The weakest failure detectors to boost obstruction-freedom
- scientific article; zbMATH DE number 7561446 (Why is no real title available?)
- scientific article; zbMATH DE number 7407798 (Why is no real title available?)
- The weakest failure detector for solving consensus
- A simple proof of the necessity of the failure detector \(\Sigma \) to implement an atomic register in asynchronous message-passing systems
- A weakest failure detector-based asynchronous consensus protocol for \(f<n\)
This page was built for publication: The weakest failure detector for solving consensus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371681)
