Consensus in the presence of partial synchrony
Explore this paper's citation graph
Summary
Fault-tolerant consensus protocols are given for various cases of partial synchrony and various fault models that allow partially synchronous processors to reach some approximately common notion of time.
- Type
- article
- Published
- 1988-04-01
- Cited by
- 2,298
- References
- 19
- Access
- Open access
- OpenAlex
- https://openalex.org/W2003214215
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:17007235
Keywords
Asynchronous communication, Computer science, Upper and lower bounds, A priori and a posteriori, Fault tolerance
References
- Distributed computation systems: modelling, verification, and algorithms
- A Quorum-Based Commit Protocol
- On the minimal synchronism needed for distributed consensus
- An Efficient Algorithm for Byzantine Agreement without Authentication
- A New Solution for the Byzantine Generals Problem
- Asynchronous Byzantine consensus
- Authenticated Algorithms for Byzantine Agreement
- Impossibility of distributed consensus with one faulty process
- Is byzantine agreement useful in a distributed database?
- Asynchronous consensus and broadcast protocols
- Byzantine generals in action
- The Weak Byzantine Generals Problem
- Reaching approximate agreement in the presence of faults
- The Byzantine Generals Problem
- Time, clocks, and the ordering of events in a distributed system
- Operating systems — an advanced course
- Knowledge and Common Knowledge in a Byzantine Environment I: Crash Failures
- The Consensus Problem in Unreliable Distributed Systems (A Brief Survey)
- Notes on Data Base Operating Systems
Cited by
- Single-Write Safe Consensus using Constrained Inputs
- Communication-efficient randomized consensus
- Speculative Execution Across Layers
- Programming Model and Protocols for Reconfigurable Distributed Systems
- On the Possibility of Consensus in Asynchronous Systems
- Resource Discovery and Cooperation in Decentralized Systems
- ENFORCING A GLOBAL RESOURCE QUOTA IN A GRID ENVIRONMENT
- Optimized Self-synchronizing Byzantine Agreement Protocols
- On the Core Mechanisms of Consensus Algorithms for Benign and Byzantine Faults
- Intrusion-tolerant replication under attack
- Self-Stabilizing Failure Detector Algorithms
- Agreement-related problems: from semi-passive replication to totally ordered broadcast
- Group Communication Protocols and a Framework for Intrusion-Tolerant Distributed Applications
- How to Deal with Replication and Recovery in a Distributed File Server
- A Framework for Communication Support in Object Oriented Distributed Systems
- An efficient failure detector for sparsely connected networks
- Leveraging Altruism in Cooperative Services
- Efficient Reductions for Wait-Free Termination Detection in Faulty Distributed Systems
- Distributed resource allocation with scalable crash containment
- On the Improbability of Reaching Byzantine Agreements (Preliminary Version)
Related papers
- Exploring asynchronous and synchronous tool use in online courses
- Information consensus of asynchronous discrete-time multi-agent systems
- H ∞ filtering for switched nonlinear systems under asynchronous switching
- Challenges for Asynchronous Collaboration in Augmented Reality
- Dynamics of time and information in dynamic time.
- An analysis of the a priori and a posteriori
- Use of WhatsApp in Synchronous and Asynchronous Education in Students of the IV Cycle of Peruvian basic Education
- How to Understand a Priori Knowledge