Abstract
Allowing read operations to return stale data with low probability has been proposed as a means to increase availability in quorums systems. Existing solutions that allow stale reads cannot tolerate an adversarial scheduler that can maliciously delay messages between servers and clients in the system and for such a scheduler existing solutions cannot enforce a bound on the staleness of data read. This paper considers the possibility of increasing system availability while at the same time tolerating a malicious scheduler and guaranteeing an upper bound on the staleness of data. We characterize the conditions under which this increase is possible and show that it depends on the ratio of the write frequency to the servers’ failure frequency. For environments with a relatively large failure frequency compared to write frequency, we propose K-quorums that can provide higher availability than the strict quorum systems and also guarantee bounded staleness. We also propose a definition of k-atomicity and present a protocol to implement a k-atomic register using k-quorums.
This work was supported in part by NSF CyberTrust award 0430510, an Alfred P. Sloan Fellowhip and a grant from the Texas Advanced Technology Program.
This is a preview of subscription content, log in via an institution to check access.
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
Amr El Abbadi, D.S., Cristian, F.: An efficient and fault-tolerant protocol for replicated data management. In: Proc. PODS (1985)
Amr El Abbadi, D.S., Cristian, F.: Maintaining availability in partioned replicated databases. In: Proc. PODS (1986)
Andersen, D.G., Balakrishnan, H., Kaashoek, M.F., Morris, R.: Resilient overlay networks. In: Proc. 18th SOSP, pp. 131–145 (2001)
Eager, D.L., Sevcik, K.C.: Achieving robustness in distributed database systems. ACM Trans. Database Syst. 8(3), 354–381 (1983)
Fox, A., Brewer, E.A.: Harvest, yield and scalable tolerant systems. In: Wkshp. on Hot Topics in Op. Sys., pp. 174–178 (1999)
Gifford, D.K.: Weighted voting for replicated data. In: Proc. 7th SOSP, pp. 150–162. ACM Press, New York (1979)
Guy, R.G., Heidemann, J.S., Mak, W., Page Jr., T.W., Popek, G.J., Rothmeir, D.: Implementation of the Ficus Replicated File System. In: Proceedings of the Summer 1990 USENIX Conference, June 1990, pp. 63–71 (1990)
Krishnakumar, N., Bernstein, A.J.: Bounded ignorance in replicated systems. In: Proc. PODS, pp. 63–74. ACM Press, New York (1991)
Lamport, L.: On interprocess communication. part i: Basic formalism. Distributed Computing 1(2), 77–101 (1986)
Lee, H., Welch, J.L.: Randomized registers and iterative algorithms. Distributed Computing 17(3), 209–221 (2005)
Malkhi, D., Reiter, M.K., Wool, A., Wright, R.N.: Probabilistic quorum systems. Inf. Comput. 170(2), 184–206 (2001)
Martin, J.-P., Alvisi, L., Dahlin, M.: Small Byzantine quorum systems. In: DSN, June 2002, pp. 374–383 (2002)
Naor, M., Wool, A.: The load, capacity, and availability of quorum systems. SIAM Journal on Computing 27(2), 423–447 (1998)
Peleg, D., Wool, A.: The availability of quorum systems. Inf. Comput. 123(2), 210–223 (1995)
Petersen, K., Spreitzer, M.J., Terry, D.B., Theimer, M.M., Demers, A.J.: Flexible update propagation for weakly consistent replication. In: Proc. 16th SOSP (1997)
Pu, C., Leff, A.: Replica control in distributed systems: An asynchronous approach. In: SIGMOD Conference, pp. 377–386 (1991)
Satyanarayanan, M., Kistler, J.J., Kumar, P., Okasaki, M.E., Siegel, E.H., Steere, D.C.: Coda: A highly available file system for a distributed workstation environment. IEEE Transactions on Computers 39(4), 447–459 (1990)
Skeen, D., Wright, D.D.: Increasing availability in partitioned database systems. In: Proc. PODS, pp. 290–299. ACM Press, New York (1984)
Susan Davidson, H.G.-M., Skeen, D.: Consistency in partioned network. Computing Survey 17(3) (1985)
Yu, H.: Signed quorum systems. In: Proc. 23rd PODC, pp. 246–255. ACM Press, New York (2004)
Yu, H., Vahdat, A.: The costs and limits of availability for replicated services. In: Proc. 18th SOSP, pp. 29–42 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aiyer, A., Alvisi, L., Bazzi, R.A. (2005). On the Availability of Non-strict Quorum Systems. In: Fraigniaud, P. (eds) Distributed Computing. DISC 2005. Lecture Notes in Computer Science, vol 3724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561927_6
Download citation
DOI: https://doi.org/10.1007/11561927_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29163-3
Online ISBN: 978-3-540-32075-3
eBook Packages: Computer ScienceComputer Science (R0)