Synchronous consensus under hybrid process and link failures
From MaRDI portal
Recommendations
Cites work
- A formally verified algorithm for clock synchronization under a hybrid fault model
- A new solution for the Byzantine generals problem
- A tradeoff between safety and liveness for randomized coordinated attack protocols
- Agreement in synchronous networks with ubiquitous faults
- Atomic broadcast: From simple message diffusion to Byzantine agreement
- Authenticated Algorithms for Byzantine Agreement
- Distributed agreement in the presence of processor and communication faults
- Exploiting omissive faults in synchronous approximate agreement
- Failure detection and consensus in the crash-recovery model
- How to reconcile fault-tolerant interval intersection with the Lipschitz condition
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 1950667 (Why is no real title available?)
- scientific article; zbMATH DE number 854547 (Why is no real title available?)
- Impossibility Results and Lower Bounds for Consensus under Link Failures
- New hybrid fault models for asynchronous approximate agreement
- Operating systems. An advanced course
- Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links
- Orthogonal accuracy clock synchronization
- Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony
- Synchronous consensus under hybrid process and link failures
- The Byzantine Generals Problem
- The Byzantine generals strike again
- The customizable fault/error model for dependable distributed systems.
- The Heard-Of model: computing in distributed systems with benign faults
- Time is not a healer (preliminary version)
- Tolerating corrupted communication
- Uniform consensus is harder than consensus
Cited in
(16)- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
- Booting clock synchronization in partially synchronous systems with hybrid process and link failures
- Consensus in rooted dynamic networks with short-lived stability
- Eliminating message counters in synchronous threshold automata
- Reconciling fault-tolerant distributed algorithms and real-time computing
- Of choices, failures and asynchrony: the many faces of set agreement
- Impossibility Results and Lower Bounds for Consensus under Link Failures
- scientific article; zbMATH DE number 1225032 (Why is no real title available?)
- On the impact of link faults on Byzantine agreement
- Tutorial on parameterized model checking of fault-tolerant distributed algorithms
- The Synchronous Condition-Based Consensus Hierarchy
- Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
- Asynchronous Byzantine reliable broadcast with a message adversary
- Round-Oblivious Stabilizing Consensus in Dynamic Networks
- The time complexity of consensus under oblivious message adversaries
- Synchronous consensus under hybrid process and link failures
This page was built for publication: Synchronous consensus under hybrid process and link failures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q719299)
