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.
- Anonymous asynchronous systems: the case of failure detectors (Q360279) (← links)
- Algorithms for a distributed IDS in MANETs (Q389376) (← links)
- Corona: a stabilizing deterministic message-passing skip list (Q392011) (← links)
- The weakest failure detector to implement a register in asynchronous systems with hybrid communication (Q392012) (← links)
- Power and limits of distributed computing shared memory models (Q392187) (← links)
- Consensus in the presence of mortal Byzantine faulty processes (Q424903) (← links)
- \textsc{Ramos}: concurrent writing and reconfiguration for collaborative systems (Q433441) (← links)
- Pronto: high availability for standard off-the-shelf databases (Q436657) (← links)
- Message and time efficient consensus protocols for synchronous distributed systems (Q436769) (← links)
- On termination detection in crash-prone distributed systems with failure detectors (Q436803) (← links)
- Using asynchrony and zero degradation to speed up indulgent consensus protocols (Q436832) (← links)
- The renaming problem in shared memory systems: an introduction (Q465682) (← links)
- Communication-optimal eventually perfect failure detection in partially synchronous systems (Q473190) (← links)
- The impossibility of boosting distributed service resilience (Q550250) (← links)
- On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems (Q555307) (← links)
- Verification of consensus algorithms using satisfiability solving (Q658669) (← links)
- \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks (Q660994) (← links)
- Threshold protocols in survivor set systems (Q661005) (← links)
- The disagreement power of an adversary (Q661056) (← links)
- On set consensus numbers (Q661057) (← links)
- Randomization can be a healer: consensus with dynamic omission failures (Q661060) (← links)
- The minimum information about failures for solving non-local tasks in message-passing systems (Q661069) (← links)
- Distributed fault detection and isolation of continuous-time non-linear systems (Q693695) (← links)
- The asynchronous bounded-cycle model (Q719298) (← links)
- Fault-management in P2P-MPI (Q735358) (← links)
- Implementing unreliable failure detectors with unknown membership (Q845828) (← links)
- A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems (Q845867) (← links)
- A timing assumption and two \(t\)-resilient protocols for Implementing an eventual leader service in asynchronous shared memory systems (Q848847) (← links)
- Light-weight leases for storage-centric coordination (Q853758) (← links)
- The perfectly synchronized round-based model of distributed computing (Q879602) (← links)
- A theory of system behaviour in the presence of node and link failure (Q939442) (← links)
- An impossibility about failure detectors in the iterated immediate snapshot model (Q975436) (← links)
- A simple and communication-efficient omega algorithm in the crash-recovery model (Q990113) (← links)
- A simple proof of the necessity of the failure detector \(\Sigma \) to implement an atomic register in asynchronous message-passing systems (Q990136) (← links)
- Adaptive progress: a gracefully-degrading liveness property (Q992505) (← links)
- Refined quorum systems (Q992512) (← links)
- Implementing the Omega failure detector in the crash-recovery failure model (Q1004284) (← links)
- Safe termination detection in an asynchronous distributed system when processes may crash and recover (Q1004324) (← links)
- Asynchronous bounded lifetime failure detectors (Q1041728) (← links)
- On the round complexity of Byzantine agreement without initial set-up (Q1044183) (← links)
- Reducing \(\Omega\) to \(\lozenge\mathcal W\) (Q1274736) (← links)
- Increasing the resilience of distributed and replicated database systems (Q1278039) (← links)
- Using the heartbeat failure detector for quiescent reliable communication and consensus in partitionable networks (Q1292422) (← links)
- On modelling mobility (Q1575151) (← links)
- Revisiting the PAXOS algorithm (Q1575634) (← links)
- On the hardness of failure-sensitive agreement problems. (Q1603446) (← links)
- Restricted failure detectors: Definition and reduction protocols (Q1607001) (← links)
- An object based algebra for specifying a fault tolerant software architecture (Q1779322) (← links)
- A flexible formal framework for masking/demasking faults (Q1827146) (← links)
- Consensus in Byzantine asynchronous systems (Q1827288) (← links)