Synchronous condition-based consensus
From MaRDI portal
Recommendations
- The Synchronous Condition-Based Consensus Hierarchy
- Using conditions to expedite consensus in synchronous distributed systems
- Condition-based consensus solvability: a hierarchy of conditions and efficient protocols
- Condition-based consensus in synchronous systems
- A hierarchy of conditions for consensus solvability
Cites work
- A layered analysis of consensus
- A lower bound for the time to assure interactive consistency
- A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds
- A simple proof of the uniform consensus synchronous lower bound.
- Condition-based consensus in synchronous systems
- Condition-based consensus solvability: a hierarchy of conditions and efficient protocols
- Conditions on input vectors for consensus solvability in asynchronous distributed systems
- Early stopping in Byzantine agreement
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 1179121 (Why is no real title available?)
- scientific article; zbMATH DE number 2013823 (Why is no real title available?)
- scientific article; zbMATH DE number 2013840 (Why is no real title available?)
- Impossibility of distributed consensus with one faulty process
- Knowledge and common knowledge in a Byzantine environment: Crash failures
- More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
- Reaching approximate agreement in the presence of faults
- Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony
- Structural Information and Communication Complexity
- Synchronous Condition-Based Consensus Adapting to Input-Vector Legality
- The Synchronous Condition-Based Consensus Hierarchy
- Uniform consensus is harder than consensus
- Unifying synchronous and asynchronous message-passing models
- Unreliable failure detectors for reliable distributed systems
- Using conditions to expedite consensus in synchronous distributed systems
Cited in
(27)- Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound
- Necessary and sufficient conditions for broadcast consensus protocols.
- A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds
- The overhead of consensus failure recovery
- Unbeatable consensus
- Synchronous, with a chance of partition tolerance
- A layered analysis of consensus
- BBUFs: synchronization mechanism
- Communication patterns and input patterns in distributed computing (invited talk)
- One-Step Consensus Solvability
- How to Solve Consensus in the Smallest Window of Synchrony
- Continuous Consensus with Failures and Recoveries
- No Double Discount: Condition-Based Simultaneity Yields Limited Gain
- On the minimal synchronism needed for distributed consensus
- No double discount: condition-based simultaneity yields limited gain
- Uniform consensus is harder than consensus
- Condition-based consensus solvability: a hierarchy of conditions and efficient protocols
- What can be computed in a distributed system?
- Narrowing Power vs. Efficiency in Synchronous Set Agreement
- The Synchronous Condition-Based Consensus Hierarchy
- Synchronous Condition-Based Consensus Adapting to Input-Vector Legality
- Condition-based consensus in synchronous systems
- Using conditions to expedite consensus in synchronous distributed systems
- SOFSEM 2004: Theory and Practice of Computer Science
- Synchronizing the consistency relation
- Synchronous t-resilient consensus in arbitrary graphs
- Synchronous consensus under hybrid process and link failures
This page was built for publication: Synchronous condition-based consensus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2375299)
