Abstract
We provide efficient constructions and tight bounds for shared memory systems accessed by n processes, up to t of which may exhibit Byzantine faults, in a model previously explored by Malkhi et al. [MMRT00]. We show that sticky bits are universal in the Byzantine failure model for n ≥ 3t + 1, an improvement over the previous result requiring n ≥ (2t+1)(t + 1). Our result follows from a new strong consensus construction that uses sticky bits and tolerates t Byzantine failures among n processes for any n ≥ 3t + 1, the best possible bound on n for strong consensus. We also present tight bounds on the efficiency of implementations of strong consensus objects from sticky bits and similar primitive objects.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N. Alon. Private communication.
N. Alon, J.H. Spencer, and P. Erdős. The probabilistic method. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley and Sons, Inc., 1992.
P. Berman and J.A. Garay. Asymptotical optimal distributed consensus. Proceedings of the 16th International Colloquium on Automata, Languages and Programming (ICALP 89), LNCS 372, pp. 80–94, 1989.
P. Erdös, P. Frankl and Z. Füredi. Families of finite sets in which no set is covered by the union of others. Israel Journal of Mathematics 51:75–89, 1985.
F. Fich, M. Herlihy, and N. Shavit, On the Space Complexity of Randomized Synchronization. Journal of the ACM, 45(5):843–862, September 1998.
M.J. Fischer, N.A. Lynch, and M.S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374–382, April 1985.
M. Grötschel, R. L. Graham, and L. Lovász, Handbook of Combinatorics. Vol. 1, 2. MIT Press. 1995.
M.P. Herlihy and J.M. Wing. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems 12(3):463–492, July 1990.
M.P. Herlihy. Wait-free synchronization, ACM Transactions on Programming Languages and Systems 13(1):124–149, January 1991.
M.C. Loui and H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, 4:163–183, 1987.
J. Misra. A simple proof of a simple consensus algorithm. Information Processing Letters, 33(1):21–24, 1989.
D. Malkhi, M. Merritt, M. Reiter, and G. Taubenfeld. Objects shared by Byzantine processes. Proceedings of the 14th International Symposium on Distributed Computing (DISC 2000), LNCS 1914, pp. 345–359, 2000.
S.A. Plotkin. Sticky bits and universality of consensus. In Proc. 8th ACM Symp. on Principles of Distributed Computing, pages 159–175, August 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Merritt, M., Reingold, O., Taubenfeld, G., Wright, R.N. (2002). Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes. In: Malkhi, D. (eds) Distributed Computing. DISC 2002. Lecture Notes in Computer Science, vol 2508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36108-1_15
Download citation
DOI: https://doi.org/10.1007/3-540-36108-1_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00073-0
Online ISBN: 978-3-540-36108-4
eBook Packages: Springer Book Archive