Unreliable failure detectors for reliable distributed systems
From MaRDI portal
Publication:4371670
Recommendations
- The weakest failure detector for solving consensus
- Byzantine Fault Detectors for Solving Consensus
- The weakest failure detector for solving consensus
- A simple and fast asynchronous consensus protocol based on a weak failure detector
- A necessary and sufficient condition for transforming limited accuracy failure detectors
Cited in
(only showing first 100 items - show all)- Implementing the Omega failure detector in the crash-recovery failure model
- Safe termination detection in an asynchronous distributed system when processes may crash and recover
- Asynchronous bounded lifetime failure detectors
- On the round complexity of Byzantine agreement without initial set-up
- Reducing to W
- Increasing the resilience of distributed and replicated database systems
- Using the heartbeat failure detector for quiescent reliable communication and consensus in partitionable networks
- On modelling mobility
- Revisiting the PAXOS algorithm
- On the hardness of failure-sensitive agreement problems.
- Restricted failure detectors: Definition and reduction protocols
- In search of lost time
- 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
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
- On mobile agent verifiable problems
- An object based algebra for specifying a fault tolerant software architecture
- A flexible formal framework for masking/demasking faults
- Consensus in Byzantine asynchronous systems
- Byzantine-resistant total ordering algorithms.
- Optimistic atomic broadcast: A pragmatic viewpoint
- A necessary and sufficient condition for transforming limited accuracy failure detectors
- Partial synchrony based on set timeliness
- Failure detectors encapsulate fairness
- 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
- 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 k-set agreement with limited-scope failure detectors
- On the importance of having an identity or, is consensus really universal?
- The weakest failure detector to solve nonuniform consensus
- The overhead of consensus failure recovery
- Transient fault detectors
- Booting clock synchronization in partially synchronous systems with hybrid process and link failures
- Failure detectors as type boosters
- The weakest failure detectors to boost obstruction-freedom
- Low-latency atomic broadcast in the presence of contention
- When consensus meets self-stabilization
- Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures
- Consensus in rooted dynamic networks with short-lived stability
- The weakest failure detector for eventual consistency
- Communication-efficient randomized consensus
- Contention-related crash failures: definitions, agreement algorithms, and impossibility results
- Making Byzantine consensus live
- A visit to mutual exclusion in seven dates
- Uniform reliable broadcast in anonymous distributed systems with fair lossy channels
- Set-constrained delivery broadcast: a communication abstraction for read/write implementable distributed objects
- Consensus in anonymous asynchronous systems with crash-recovery and omission failures
- Synchronous condition-based consensus
- Dynamic group communication
- The Theta-Model: achieving synchrony without clocks
- The Heard-Of model: computing in distributed systems with benign faults
- Consensus and collision detectors in radio networks
- On the computability power and the robustness of set agreement-oriented failure detector classes
- On implementing omega in systems with weak reliability and synchrony assumptions
- On the weakest failure detector ever
- A weakest failure detector-based asynchronous consensus protocol for \(f<n\)
- Correctness proof of a database replication protocol under the perspective of the I/O automaton model
- Distributed consensus, revisited
- An infrastructure to support cooperation of knowledge-level agents on the semantic grid
- The expressive power of snap-stabilization
- Secure consensus with distributed detection via two-hop communication
- Agreeing within a few writes
- Data-driven mixed-integer linear programming-based optimisation for efficient failure detection in large-scale distributed systems
- Generalized symmetry breaking tasks and nondeterminism in concurrent objects
- Simultaneous consensus vs set agreement: a message-passing-sensitive hierarchy of agreement problems
- Asynchronous failure detectors
- Failure detectors in loosely named systems
- From binary consensus to multivalued consensus in asynchronous message-passing systems
- EFFICIENT SOLUTION TO UNIFORM ATOMIC BROADCAST
- What you always wanted to know about model checking of fault-tolerant distributed algorithms
- Efficient and modular consensus-free reconfiguration for fault-tolerant storage
- Synthesis of distributed algorithms with parameterized threshold guards
- A distributed leader election algorithm in crash-recovery and omissive systems
- Communication patterns and input patterns in distributed computing (invited talk)
- A separation of \(n\)-consensus and \((n+1)\)-consensus based on process scheduling
- The Iterated Restricted Immediate Snapshot Model
- How to Solve Consensus in the Smallest Window of Synchrony
- The Weakest Failure Detector for Message Passing Set-Agreement
- Using Bounded Model Checking to Verify Consensus Algorithms
- Eventually perfect predicate detection in crash-affected finite average response time systems
- Anonymous asynchronous systems: the case of failure detectors
- Deterministic Models of Communication Faults
- Anonymous asynchronous systems: the case of failure detectors
- The DHCP Failover Protocol: A Formal Perspective
- Algorithms for a distributed IDS in MANETs
- Corona: a stabilizing deterministic message-passing skip list
- The weakest failure detector to implement a register in asynchronous systems with hybrid communication
- Power and limits of distributed computing shared memory models
- Failure Detection and Randomization: A Hybrid Approach to Solve Consensus
- Consensus in the presence of mortal Byzantine faulty processes
- \textsc{Ramos}: concurrent writing and reconfiguration for collaborative systems
- Pronto: high availability for standard off-the-shelf databases
- Message and time efficient consensus protocols for synchronous distributed systems
- On termination detection in crash-prone distributed systems with failure detectors
- Using asynchrony and zero degradation to speed up indulgent consensus protocols
- scientific article; zbMATH DE number 1948959 (Why is no real title available?)
This page was built for publication: Unreliable failure detectors for reliable distributed systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371670)
