Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Fast asynchronous Byzantine agreement (extended abstract)
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Bounds on information exchange for Byzantine Agreement
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Asynchronous Byzantine consensus
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
An asynchronous [(n - 1)/3]-resilient consensus protocol
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Randomized Byzantine Agreements
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Asynchronous approximate agreement
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Commitment in a partitioned distributed database
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
A Compiler that Increases the Fault Tolerance of Asynchronous Protocols
IEEE Transactions on Computers
Toward a non-atomic era: l-exclusion as a test case
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Optimal algorithms for Byzantine agreement
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Impossibility and universality results for wait-free synchronization
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
On achieving consensus using a shared memory
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
A hundred impossibility proofs for distributed computing
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Sticky bits and universality of consensus
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Bounded polynomial randomized consensus
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Renaming in an asynchronous environment
Journal of the ACM (JACM)
Early-delivery atomic broadcast
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Agreement is harder than consensus: set consensus problems in totally asynchronous systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Time-and space-efficient randomized consensus
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Lower bounds for wait-free computation in message-passing systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
A methodology for implementing highly concurrent data structures
PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Bounds on the time to reach agreement in the presence of timing uncertainty
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Randomized wait-free concurrent objects (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Consensus in the presence of timing uncertainty: omission and Byzantine failures (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Unreliable failure detectors for asynchronous systems (preliminary version)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Impossibility results for asynchronous PRAM (extended abstract)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Optimal time randomized consensus—making resilient algorithms fast in practice
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
The weakest failure detector for solving consensus
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
The impact of time on the session problem
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
The consensus problem in fault-tolerant computing
ACM Computing Surveys (CSUR)
Use of Common Time Base for Checkpointing and Rollback Recovery in a Distributed System
IEEE Transactions on Software Engineering
A methodology for implementing highly concurrent data objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Resource bounds and combinations of consensus objects
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
On the robustness of Herlihy's hierarchy
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Generalized FLP impossibility result for t-resilient asynchronous computations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Contention in shared memory algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Bounds on the time to reach agreement in the presence of timing uncertainty
Journal of the ACM (JACM)
Are wait-free algorithms fast?
Journal of the ACM (JACM)
Time-adaptive algorithms for synchronization
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Delimiting the power of bounded size synchronization objects (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
On the use of registers in achieving wait-free consensus
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Byzantine Agreement in a Generalized Connected Network
IEEE Transactions on Parallel and Distributed Systems
Failure detectors and the wait-free hierarchy (extended abstract)
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Efficient execution of nondeterministic parallel programs on asynchronous systems
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Fail-awareness in timed asynchronous systems
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Lower bounds for distributed coin-flipping and randomized consensus
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
All of us are smarter than any of us: wait-free hierarchies are not robust
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The decidability of distributed decision tasks (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Efficient asynchronous consensus with the weak adversary scheduler
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Journal of the ACM (JACM)
Contention in shared memory algorithms
Journal of the ACM (JACM)
Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Structured derivations of consensus algorithms for failure detectors
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Lower bounds for distributed coin-flipping and randomized consensus
Journal of the ACM (JACM)
Fault-tolerant wait-free shared objects
Journal of the ACM (JACM)
On the space complexity of randomized synchronization
Journal of the ACM (JACM)
Garbage collecting the Internet: a survey of distributed garbage collection
ACM Computing Surveys (CSUR)
Fundamentals of fault-tolerant distributed computing in asynchronous environments
ACM Computing Surveys (CSUR)
Cooperative sharing and asynchronous consensus using single-reader single-writer registers
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
CSC '91 Proceedings of the 19th annual conference on Computer Science
The topological structure of asynchronous computability
Journal of the ACM (JACM)
Fast deterministic consensus in a noisy environment
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
On k-Set Consensus Problems in Asynchronous Systems
IEEE Transactions on Parallel and Distributed Systems
Conditions on input vectors for consensus solvability in asynchronous distributed systems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Computing in totally anonymous asynchronous shared memory systems
Information and Computation
Active disk paxos with infinitely many processes
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Fast deterministic consensus in a noisy environment
Journal of Algorithms
Mastering Agreement Problems in Distributed Systems
IEEE Software
Fast Asynchronous Uniform Consensus in Real-Time Distributed Systems
IEEE Transactions on Computers
Optimal Agreement Protocol in Malicious Faulty Processors and Faulty Links
IEEE Transactions on Knowledge and Data Engineering
Broadcast Protocols for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Algorithms for Fair Interprocess Synchronization
IEEE Transactions on Parallel and Distributed Systems
Compositional Programming Abstractions for Mobile Computing
IEEE Transactions on Software Engineering
Solving Agreement Problems with Weak Ordering Oracles
EDCC-4 Proceedings of the 4th European Dependable Computing Conference on Dependable Computing
An Efficient Solution to the k-Set Agreement Problem
EDCC-4 Proceedings of the 4th European Dependable Computing Conference on Dependable Computing
Fast Indulgent Consensus with Zero Degradation
EDCC-4 Proceedings of the 4th European Dependable Computing Conference on Dependable Computing
New Perspectives in Distributed Computing
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Failure Detection vs Group Membership in Fault-Tolerant Distributed Systems: Hidden Trade-Offs
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Efficient Algorithms to Implement Unreliable Failure Detectors in Partially Synchronous Systems
Proceedings of the 13th International Symposium on Distributed Computing
A Probabilistically Correct Leader Election Protocol for Large Groups
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Distributed Agreement and Its Relation with Error-Correcting Codes
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Condition-Based Protocols for Set Agreement Problems
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Revisiting Safety and Liveness in the Context of Failures
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Agreement Problems in Fault-Tolerant Distributed Systems
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Consensus in Asynchronous Distributed Systems: A Concise Guided Tour
Advances in Distributed Systems, Advanced Distributed Computing: From Algorithms to Systems
A classification of wait-free loop agreement tasks
Theoretical Computer Science - Special issue: Distributed computing
Real-Time Fault-Tolerant Atomic Broadcast
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Real-time dependable decisions in timed asynchronous distributed systems
WORDS '97 Proceedings of the 3rd Workshop on Object-Oriented Real-Time Dependable Systems - (WORDS '97)
Three-tier replication for FT-CORBA infrastructures
Software—Practice & Experience
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Journal of the ACM (JACM)
A Consensus Protocol for CAN-Based Systems
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Randomized protocols for asynchronous consensus
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Appraising two decades of distributed computing theory research
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
A necessary and sufficient condition for transforming limited accuracy failure detectors
Journal of Computer and System Sciences
On the Implementation of Unreliable Failure Detectors in Partially Synchronous Systems
IEEE Transactions on Computers
Communication-efficient leader election and consensus with limited link synchrony
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Characterizing distributed systems using knowledge-based models: preliminary version
TARK '92 Proceedings of the 4th conference on Theoretical aspects of reasoning about knowledge
A simple and fast asynchronous consensus protocol based on a weak failure detector
Distributed Computing
On the use of registers in achieving wait-free consensus
Distributed Computing
Early consensus in an asynchronous system with a weak failure detector
Distributed Computing
Total order broadcast and multicast algorithms: Taxonomy and survey
ACM Computing Surveys (CSUR)
ExchangeGuard: A Distributed Protocol for Electronic Fair-Exchange
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Design and analysis of dynamic leader election protocols in broadcast networks
Distributed Computing
Atomic snapshots using lattice agreement
Distributed Computing
Necessary and sufficient conditions for broadcast consensus protocols
Distributed Computing
Reliability versus cost: design of a probabilistic broadcast algorithm
Distributed Computing
Solving Vector Consensus with a Wormhole
IEEE Transactions on Parallel and Distributed Systems
EURASIP Journal on Wireless Communications and Networking
From Set Membership to Group Membership: A Separation of Concerns
IEEE Transactions on Dependable and Secure Computing
Active disk Paxos with infinitely many processes
Distributed Computing - Special issue: PODC 02
Synchronizing without locks is inherently expensive
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
The notification based approach to implementing failure detectors in distributed systems
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
Journal of Parallel and Distributed Computing
Low complexity Byzantine-resilient consensus
Distributed Computing
Condition Adaptation in Synchronous Consensus
IEEE Transactions on Computers
Local analysis of atomicity sphere for B2B collaboration
Proceedings of the 14th ACM SIGSOFT international symposium on Foundations of software engineering
A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems
Information Processing Letters
Adaptive timeliness of consensus in presence of crash and timing faults
Journal of Parallel and Distributed Computing
On the Respective Power of ◊P and ◊S to Solve One-Shot Agreement Problems
IEEE Transactions on Parallel and Distributed Systems
An Adaptive Programming Model for Fault-Tolerant Distributed Computing
IEEE Transactions on Dependable and Secure Computing
Asynchronous Agreement and Its Relation with Error-Correcting Codes
IEEE Transactions on Computers
The gap in circumventing the impossibility of consensus
Journal of Computer and System Sciences
Every problem has a weakest failure detector
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Optimal message-driven implementations of omega with mute processes
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
The Asynchronous Bounded-Cycle Model
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
With Finite Memory Consensus Is Easier Than Reliable Broadcast
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Non-blocking programming on multi-core graphics processors: (extended asbtract)
ACM SIGARCH Computer Architecture News
A Generic Group Communication Approach for Hybrid Distributed Systems
DAIS '09 Proceedings of the 9th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems
Brief announcement: global consistency can be easier than point-to-point communication
Proceedings of the 28th ACM symposium on Principles of distributed computing
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Optimal message-driven implementation of omega with mute processes
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Design and performance of a generic consensus component for critical distributed applications
Ada-Europe'07 Proceedings of the 12th international conference on Reliable software technologies
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
On the probabilistic omission adversary
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Randomization can be a healer: consensus with dynamic omission failures
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Information Processing Letters
The failure detector abstraction
ACM Computing Surveys (CSUR)
Fast asynchronous consensus with optimal resilience
DISC'10 Proceedings of the 24th international conference on Distributed computing
On the impossibility of implementing perpetual failure detectors in partially synchronous systems
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Failure detectors encapsulate fairness
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
An adaptive technique for constructing robust and high-throughput shared objects
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Efficient fault tolerant consensus using preemptive token
ACAI '11 Proceedings of the International Conference on Advances in Computing and Artificial Intelligence
On composability of reliable unicast and broadcast
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Authenticated Byzantine generals in dual failure model
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
The Asynchronous Bounded-Cycle model
Theoretical Computer Science
Byzantine agreement using partial authentication
DISC'11 Proceedings of the 25th international conference on Distributed computing
Correctness of Gossip-Based Membership under Message Loss
SIAM Journal on Computing
On the possibility and the impossibility of message-driven self-stabilizing failure detection
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
Group communication: from practice to theory
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Optimal and practical WAB-based consensus algorithms
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Lock-Free parallel algorithms: an experimental study
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
SecondSite: disaster tolerance as a service
VEE '12 Proceedings of the 8th ACM SIGPLAN/SIGOPS conference on Virtual Execution Environments
Failure detection with booting in partially synchronous systems
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
An improved algorithm for adaptive condition-based consensus
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Computing with reads and writes in the absence of step contention
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Proactive leader election in asynchronous shared memory systems
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Dependable Systems
Algorithms for extracting timeliness graphs
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Easy impossibility proofs for k-set agreement in message passing systems
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Byzantine agreement with homonyms in synchronous systems
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Efficient transformations of obstruction-free algorithms into non-blocking algorithms
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Exploiting partitioned synchrony to implement accurate failure detectors
International Journal of Critical Computer-Based Systems
Enhancing group communication with self-manageable behavior
Journal of Parallel and Distributed Computing
Byzantine agreement with homonyms in synchronous systems
Theoretical Computer Science
Hi-index | 0.02 |
Reaching agreement is a primitive of distributed computing. Whereas this poses no problem in an ideal, failure-free environment, it imposes certain constraints on the capabilities of an actual system: A system is viable only if it permits the existence of consensus protocols tolerant to some number of failures. Fischer et al. have shown that in a completely asynchronous model, even one failure cannot be tolerated. In this paper their work is extended: Several critical system parameters, including various synchrony conditions, are identified and how varying these affects the number of faults that can be tolerated is examined. The proofs expose general heuristic principles that explain why consensus is possible in certain models but not possible in others.