Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Pease, R. Shostak, L. Lamport (1980)
Reaching Agreement in the Presence of FaultsJ. ACM, 27
A. Bar-Noy, D. Dolev, D. Dolev, C. Dwork, H. Strong (1987)
Shifting gears: changing algorithms on the fly to expedite Byzantine agreementInf. Comput., 97
Y. Moses, Orli Waarts (1988)
Coordinated traversal: (t+1)-round Byzantine agreement in polynomial time[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
S. Toueg, K. Perry, T. Srikanth (1987)
Fast Distributed AgreementSIAM J. Comput., 16
P. Berman, J. Garay (1989)
Asymptotically Optimal Distributed Consensus (Extended Abstract)
P. Berman, J. Garay, K. Perry (1989)
Towards optimal distributed consensus30th Annual Symposium on Foundations of Computer Science
B. Coan (1986)
A communication-efficient canonical form for fault-tolerant distributed protocols
M. Fischer, N. Lynch (1982)
A Lower Bound for the Time to Assure Interactive ConsistencyInf. Process. Lett., 14
Three main parameters characterize the efficiency of algorithms that solve the Consensus Problem: the ratio between the total number of processors and the maximum number of faulty processors (n andt, respectively), the number of rounds, and the upper bound on the size of any message. In this paper we present a trade-off between the number of faulty processors and the number of rounds by exhibiting a family of algorithms in which processors communicate by one-bit messages. Letk be a positive integer and lets=t 1/k . The family includes algorithms where the number of processors is less than $$5{\mathbf{ }}t^{\frac{{(k + 1)}}{k}} = 5 \cdot s \cdot t$$ , and the number of rounds is less than $${\mathbf{ }}t + 3{\mathbf{ }}t^{\frac{{(k - 1)}}{k}} = 1 + \frac{3}{s}$$ . This family is based on a very simple algorithm with the following complexity: (2t+1)(t+1) processors,t+1 rounds, and one-bit message size.
Distributed Computing – Springer Journals
Published: May 11, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.