Abstract
We present the first direct bounded wait-free implementation of a replicated register with atomic semantics in a system with an unbounded number of clients and in which up to f servers are subject to Byzantine failures. In a system with n ≥4f+i+1 servers, and in the presence of a single writer, our implementation requires 5 messages from the reader and at most 6+2(f–i) messages per correct server per read operation and 2 request and 2 reply messages per server for each write operation. Unlike previous solutions, the number of messages is independent of the number of write operations that are concurrent with a read operation. For the case of multiple writers, a read operation requires 5 messages for the reader and no more than 6+2c(f–i) reply messages per correct server, where c is the number of writers that execute concurrently with the read operations, and a write operation requires 4 request and 4 reply messages per server. The message requirements of our wait-free implementations are considerably better in the worst case than those of the best known non wait-free implementations. If there is a bound on the number of writers, the total number of messages sent by a server is linear in the number of read operations, so faulty servers that send too many messages will be detected as faulty. This implementation does not rule out the possibility that a reader receives and discards many delayed messages in a read operation, so it is bounded only in an amortized sense. We describe a bounded solution in which a read operation will not receive more than a constant number of messages from a server without detecting the failure of the server. No other solution is bounded – in an amortized sense or otherwise.
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
Abraham, I., Chockler, G., Keidar, I., Malkhi, D.: Wait-free regular storage from byzantine components (unpublished manuscript)
Abraham, I., Chockler, G., Keidar, I., Malkhi, D.: Byzantine disk paxos. In: Proc. 23rd ACM Symp. on Prin. of Dist. Comp (PODC) (2004)
Attiya, H., Bar-Noy, A., Dolev, D.: Sharing memory robustly in message-passing systems. J. ACM 42(1), 124–142 (1995)
Bazzi, R.A., Ding, Y.: Non-skipping timestamps for byzantine data storage systems. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol. 3274, pp. 405–419. Springer, Heidelberg (2004)
Chockler, G., Malkhi, D.: Active disk paxos with infinitely many processes. In: Proc. 21st ACM Symp. on Prin. of Dist. Comp (PODC) (2002)
Jayanti, P., Chandra, T.D., Toueg, S.: Fault-tolerant wait-free shared objects. J. ACM 45(3), 451–500 (1998)
Li, M., Tromp, J., Vitányi, P.M.B.: How to share concurrent wait-free variables. J. ACM 43(4), 723–746 (1996)
Malkhi, D., Reiter, M.: Byzantine quorum systems. In: Proc. of the 29th ACM Symp. on Th. of Comp (STOC), pp. 569–578 (1997)
Malkhi, D., Reiter, M.K.: Secure and scalable replication in phalanx. In: Proc. Symp. on Rel. Dist. Sys (SRDS), pp. 51–58 (1998)
Martin, J.-P., Alvisi, L., Dahlin, M.: Minimal Byzantine storage. In: Proc. 18th Int. Symp. on Dist. Comp (DISC), pp. 311–325 (October 2002)
Peterson, G., Burns, J.: Concurrent reading while writing ii: The multiwriter case. In: Proc. 28th IEEE Symp. Found. Comput. Sci. (FOCS) (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bazzi, R.A., Ding, Y. (2006). Bounded Wait-Free f-Resilient Atomic Byzantine Data Storage Systems for an Unbounded Number of Clients. In: Dolev, S. (eds) Distributed Computing. DISC 2006. Lecture Notes in Computer Science, vol 4167. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11864219_21
Download citation
DOI: https://doi.org/10.1007/11864219_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44624-8
Online ISBN: 978-3-540-44627-9
eBook Packages: Computer ScienceComputer Science (R0)