Synchronizing clocks in the presence of faults
Journal of the ACM (JACM)
Using Time Instead of Timeout for Fault-Tolerant Distributed Systems.
ACM Transactions on Programming Languages and Systems (TOPLAS)
A communication-efficient canonical form for fault-tolerant distributed protocols
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Knowledge and common knowledge in a Byzantine environment I: crash failures
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
SIAM Journal on Computing
Bounds on information exchange for Byzantine agreement
Journal of the ACM (JACM)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Weak Byzantine Generals Problem
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Byzantine generals in action: implementing fail-stop processors
ACM Transactions on Computer Systems (TOCS)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Polynomial algorithms for multiple processor agreement
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
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
Fully polynomial Byzantine agreement in t + 1 rounds
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)
Time-optimal message-efficient work performance in the presence of faults
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Modular competitiveness for distributed algorithms
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Fault-tolerant wait-free shared objects
Journal of the ACM (JACM)
Computing Global Functions in Asynchronous Distributed Systems with Perfect Failure Detectors
IEEE Transactions on Parallel and Distributed Systems
Early stopping in global data computation
Proceedings of the twenty-first annual symposium on Principles of distributed computing
A simple proof of the uniform consensus synchronous lower bound
Information Processing Letters
Early-Delivery Dynamic Atomic Broadcast
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
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
Adaptability and the Usefulness of Hints (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Synchronous Consensus for Dependent Process Failures
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
A Timeout-Based Message Ordering Protocol for a Lightweight Software Implementation of TMR Systems
IEEE Transactions on Parallel and Distributed Systems
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Uniform consensus is harder than consensus
Journal of Algorithms
Optimal early stopping uniform consensus in synchronous systems with process omission failures
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
A simple and fast asynchronous consensus protocol based on a weak failure detector
Distributed Computing
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Compositional competitiveness for distributed algorithms
Journal of Algorithms
Fast and simple distributed consensus
Distributed Computing
Common knowledge and consistent simultaneous coordination
Distributed Computing
Fast fault-tolerant agreement algorithms
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Efficient agreement using fault diagnosis
Distributed Computing
Optimal time Byzantine agreement for t n/8 with linear-messages
Distributed Computing
A bivalency proof of the lower bound for uniform consensus
Information Processing Letters
Condition Adaptation in Synchronous Consensus
IEEE Transactions on Computers
Eventually Dual Failure Agreement
Fundamenta Informaticae
The perfectly synchronized round-based model of distributed computing
Information and Computation
Adaptive timeliness of consensus in presence of crash and timing faults
Journal of Parallel and Distributed Computing
On the benefits of cheating by self-interested agents in vehicular networks
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Message and time efficient consensus protocols for synchronous distributed systems
Journal of Parallel and Distributed Computing
Local Terminations and Distributed Computability in Anonymous Networks
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
No Double Discount: Condition-Based Simultaneity Yields Limited Gain
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
A topological treatment of early-deciding set-agreement
Theoretical Computer Science
Revisiting simultaneous consensus with crash failures
Journal of Parallel and Distributed Computing
On the round complexity of Byzantine agreement without initial set-up
Information and Computation
Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower bound
Theoretical Computer Science
Byzantine Agreement under dual failure mobile network
Computer Standards & Interfaces
An Optimal Self-stabilizing Firing Squad
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Modular construction of a Byzantine agreement protocol with optimal message bit complexity
Information and Computation
A bivalency proof of the lower bound for uniform consensus
Information Processing Letters
Compositional competitiveness for distributed algorithms
Journal of Algorithms
On the probabilistic omission adversary
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Narrowing power vs. efficiency in synchronous set agreement
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Comparing the atomic commitment and consensus problems
Future directions in distributed computing
The price of anonymity: optimal consensus despite asynchrony, crash and anonymity
DISC'09 Proceedings of the 23rd international conference on Distributed computing
On the number of synchronous rounds sufficient for authenticated byzantine agreement
DISC'09 Proceedings of the 23rd international conference on Distributed computing
The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash, and Anonymity
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Brief announcement: leaderless byzantine paxos
DISC'11 Proceedings of the 25th international conference on Distributed computing
The Complexity of Early Deciding Set Agreement
SIAM Journal on Computing
A topological treatment of early-deciding set-agreement
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Early-stopping k-set agreement in synchronous systems prone to any number of process crashes
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
An improved algorithm for adaptive condition-based consensus
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
No double discount: Condition-based simultaneity yields limited gain
Information and Computation
Accurate byzantine agreement with feedback
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
An Optimal Self-Stabilizing Firing Squad
SIAM Journal on Computing
Early deciding synchronous renaming in o( logf) rounds or less
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Eventually Dual Failure Agreement
Fundamenta Informaticae
On the message complexity of indulgent consensus
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Byzantine vector consensus in complete graphs
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Early-deciding consensus is expensive
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Brief announcement: pareto optimal solutions to consensus and set consensus
Proceedings of the 2013 ACM symposium on Principles of distributed computing
A virtual grouping based fault-tolerant scheme for autonomous networks
Engineering Applications of Artificial Intelligence
| Hi-index | 0.01 |
Two different kinds of Byzantine Agreement for distributed systems with processor faults are defined and compared. The first is required when coordinated actions may be performed by each participant at different times. This kind is called Simultaneous Byzantine Agreement (SBA).This paper deals with the number of rounds of message exchange required to reach Byzantine Agreement of either kind (BA). If an algorithm allows its participants to reach Byzantine agreement in every execution in which at most t participants are faulty, then the algorithm is said to tolerate t faults. It is well known that any BA algorithm that tolerates t faults (with t n - 1 where n denotes the total number of processors) must run at least t + 1 rounds in some execution. However, it might be supposed that in executions where the number f of actual faults is small compared to t, the number of rounds could be correspondingly small. A corollary of our first result states that (when t n - 1) any algorithm for SBA must run t + 1 rounds in some execution where there are no faults. For EBA (with t n - 1), a lower bound of min(t + 1,f + 2) rounds is proved. Finally, an algorithm for EBA is presented that achieves the lower bound, provided that t is on the order of the square root of the total number of processors.