Message and time efficient consensus protocols for synchronous distributed systems

Authors:
Xianbing Wang;Yong Meng Teo;Jiannong Cao
Affiliations:
College of Computer Science and Technology, Wuhan University, 430072, China;College of Computer Science and Technology, Wuhan University, 430072, China;Department of Computing, Hong Kong Polytechnic University, Hong Kong
Venue:
Journal of Parallel and Distributed Computing
Year:
2008

Citing 16
Cited 0

Consensus in the presence of partial synchrony

Journal of the ACM (JACM)
Early stopping in Byzantine agreement

Journal of the ACM (JACM)
Time and message efficient reliable broadcasts

Proceedings of the 4th international workshop on Distributed algorithms
Message-Optimal Protocols for Fault-Tolerant Broadcasts/Multicasts in Distributed Systems with Crash Failures

IEEE Transactions on Computers - Special issue on fault-tolerant computing
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)
Reliable computer systems (3rd ed.): design and evaluation

Reliable computer systems (3rd ed.): design and evaluation
Distributed computing: fundamentals, simulations and advanced topics

Distributed computing: fundamentals, simulations and advanced topics
Distributed Algorithms

Distributed Algorithms
A Layered Analysis of Consensus

SIAM Journal on Computing
A simple proof of the uniform consensus synchronous lower bound

Information Processing Letters
Consensus in Synchronous Systems: A Concise Guided Tour

PRDC '02 Proceedings of the 2002 Pacific Rim International Symposium on Dependable Computing
A Unified Proof of Minimum Time Complexity for Reaching Consensus and Uniform Consensus " An Oracle-Based Approach

SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Uniform consensus is harder than consensus

Journal of Algorithms
Fast fault-tolerant agreement algorithms

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
A bivalency proof of the lower bound for uniform consensus

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

For a synchronous distributed system of n processes with up to t potential and f actual crash failures, where (t