Round-by-round fault detectors (extended abstract)

DOI10.1145/277697.277724zbMath1333.68056OpenAlexW1984340066WikidataQ128791771 ScholiaQ128791771MaRDI QIDQ2790109

Eli Gafni

Publication date: 2 March 2016

Published in: Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/277697.277724

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (51)

Derivation of Heard-of Predicates from Elementary Behavioral Patterns ⋮ Synchronous condition-based consensus ⋮ The Theta-Model: achieving synchrony without clocks ⋮ The Heard-Of model: computing in distributed systems with benign faults ⋮ Distributed universality ⋮ The topology of distributed adversaries ⋮ In search of lost time ⋮ Agreeing within a few writes ⋮ Tasks in modular proofs of concurrent algorithms ⋮ Reaching agreement in the presence of contention-related crash failures ⋮ A modular approach to shared-memory consensus, with applications to the probabilistic-write model ⋮ Expected linear round synchronization: the missing link for linear Byzantine SMR ⋮ Reaching consensus in the presence of contention-related crash failures ⋮ The Iterated Restricted Immediate Snapshot Model ⋮ Of choices, failures and asynchrony: the many faces of set agreement ⋮ The inherent price of indulgence ⋮ Tight bounds for \(k\)-set agreement with limited-scope failure detectors ⋮ The overhead of consensus failure recovery ⋮ Booting clock synchronization in partially synchronous systems with hybrid process and link failures ⋮ Locality and checkability in wait-free computing ⋮ How to Solve Consensus in the Smallest Window of Synchrony ⋮ Using Bounded Model Checking to Verify Consensus Algorithms ⋮ Hundreds of impossibility results for distributed computing ⋮ Verification of consensus algorithms using satisfiability solving ⋮ A simple characterization of asynchronous computations ⋮ Tight bounds for adopt-commit objects ⋮ Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks ⋮ On the complexity of basic abstractions to implement consensus ⋮ Generating fast indulgent algorithms ⋮ Synchronous consensus under hybrid process and link failures ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Refined quorum systems ⋮ Narrowing Power vs. Efficiency in Synchronous Set Agreement ⋮ Untangling Partial Agreement: Iterated x-consensus Simulations ⋮ Wait-freedom with advice ⋮ Faster randomized consensus with an oblivious adversary ⋮ A topological treatment of early-deciding set-agreement ⋮ Wait-free approximate agreement on graphs ⋮ From adaptive renaming to set agreement ⋮ An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems ⋮ Wait-free approximate agreement on graphs ⋮ Generalized Universality ⋮ Characterizing Consensus in the Heard-Of Model ⋮ Structured Derivation of Semi-Synchronous Algorithms ⋮ Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound ⋮ Unnamed Item ⋮ Asynchronous reconfiguration with Byzantine failures ⋮ Making Byzantine consensus live ⋮ A classification of wait-free loop agreement tasks

This page was built for publication: Round-by-round fault detectors (extended abstract)