Pages that link to "Item:Q4371670"
From MaRDI portal
The following pages link to Unreliable failure detectors for reliable distributed systems (Q4371670):
Displayed 50 items.
- Byzantine-resistant total ordering algorithms. (Q1854265) (← links)
- Optimistic atomic broadcast: A pragmatic viewpoint (Q1870527) (← links)
- A necessary and sufficient condition for transforming limited accuracy failure detectors (Q1878682) (← links)
- Partial synchrony based on set timeliness (Q1938365) (← links)
- Failure detectors encapsulate fairness (Q1938374) (← links)
- Renaming and the weakest family of failure detectors (Q1938384) (← links)
- Communication-efficient and crash-quiescent omega with unknown membership (Q1944072) (← links)
- Communication-efficient failure detection and consensus in omission environments (Q1944087) (← links)
- A knowledge-theoretic analysis of uniform distributed coordination and failure detectors (Q1953242) (← links)
- Low complexity Byzantine-resilient consensus (Q1953244) (← links)
- Active disk Paxos with infinitely many processes (Q1953639) (← links)
- The inherent price of indulgence (Q1953640) (← links)
- Tight bounds for \(k\)-set agreement with limited-scope failure detectors (Q1953644) (← links)
- On the importance of having an identity or, is consensus really universal? (Q1953645) (← links)
- The weakest failure detector to solve nonuniform consensus (Q1954210) (← links)
- The overhead of consensus failure recovery (Q1954212) (← links)
- Transient fault detectors (Q1954230) (← links)
- Booting clock synchronization in partially synchronous systems with hybrid process and link failures (Q1954236) (← links)
- Failure detectors as type boosters (Q1954255) (← links)
- The weakest failure detectors to boost obstruction-freedom (Q1954262) (← links)
- Low-latency atomic broadcast in the presence of contention (Q1954263) (← links)
- When consensus meets self-stabilization (Q1959435) (← links)
- Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures (Q2009633) (← links)
- Consensus in rooted dynamic networks with short-lived stability (Q2010603) (← links)
- The weakest failure detector for eventual consistency (Q2010607) (← links)
- Communication-efficient randomized consensus (Q2075627) (← links)
- Contention-related crash failures: definitions, agreement algorithms, and impossibility results (Q2078617) (← links)
- Making Byzantine consensus live (Q2104036) (← links)
- A visit to mutual exclusion in seven dates (Q2136281) (← links)
- Fault-tolerant multiparty session types (Q2165214) (← links)
- Uniform reliable broadcast in anonymous distributed systems with fair lossy channels (Q2199064) (← links)
- Set-constrained delivery broadcast: a communication abstraction for Read/write implementable distributed objects (Q2232592) (← links)
- Consensus in anonymous asynchronous systems with crash-recovery and omission failures (Q2244065) (← links)
- Synchronous condition-based consensus (Q2375299) (← links)
- Dynamic group communication (Q2375301) (← links)
- The Theta-Model: achieving synchrony without clocks (Q2377129) (← links)
- The Heard-Of model: computing in distributed systems with benign faults (Q2377130) (← links)
- Consensus and collision detectors in radio networks (Q2377252) (← links)
- On the computability power and the robustness of set agreement-oriented failure detector classes (Q2377255) (← links)
- On implementing omega in systems with weak reliability and synchrony assumptions (Q2377261) (← links)
- On the weakest failure detector ever (Q2377264) (← links)
- A weakest failure detector-based asynchronous consensus protocol for \(f<n\) (Q2390214) (← links)
- Correctness proof of a database replication protocol under the perspective of the I/O automaton model (Q2390937) (← links)
- Distributed consensus, revisited (Q2458442) (← links)
- An infrastructure to support cooperation of knowledge-level agents on the semantic grid (Q2505036) (← links)
- Secure consensus with distributed detection via two-hop communication (Q2665414) (← links)
- Agreeing within a few writes (Q2672593) (← links)
- Data-driven mixed-integer linear programming-based optimisation for efficient failure detection in large-scale distributed systems (Q2673583) (← links)
- Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects (Q2802146) (← links)
- Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems (Q2868653) (← links)