Abstract
This paper studies a trade-off between fault-tolerance and latency in implementations of atomic read/write objects in message-passing systems. In particular, considering fast or semifast quorum-based implementations, that is, implementations where all or respectively most read and write operations complete in a single communication round-trip, it is shown that such implementations are not robust due to the fact that they necessarily require a quorum system with a common intersection between its quorums.
To trade speed for fault-tolerance, the notion of weak-semifast implementations is introduced. Here more than a single complete slow (two round-trip) read operation is allowed for each write operation (semifast implementations allow only one such slow read). A quorum-based algorithm is given next and it is formally shown that it constitutes a weak-semifast implementation of atomic registers. The algorithm uses the notion of Quorum Views to facilitate the characterization of all possible object timestamp distributions that a read operation may witness during its first communication round-trip. Noteworthy is that the algorithm allows fast read operations even if they are concurrent with other read and write operations. Finally, experimental results were gathered by simulating the algorithm using the NS-2 network simulator. The results show that under realistic conditions, less than 13% of read operations are slow, thus the overwhelming majority of operations take a single communication round-trip.
This work is supported in part by the NSF Grants 9988304, 0121277, and 0311368.
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
Attiya, H., Bar-Noy, A., Dolev, D.: Sharing memory robustly in message passing systems. Journal of the ACM 42(1), 124–142 (1996)
Dolev, S., Gilbert, S., Lynch, N., Shvartsman, A., Welch, J.: Geoquorums: Implementing atomic memory in mobile ad hoc networks. In: Proceedings of the 17th International Symposium on Distributed Computing (DISC), pp. 306–320 (2003)
Dutta, P., Guerraoui, R., Levy, R.R., Chakraborty, A.: How fast can a distributed atomic read be? In: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC), pp. 236–245 (2004)
Englert, B., Shvartsman, A.A.: Graceful quorum reconfiguration in a robust emulation of shared memory. In: Proceedings of 20th International Conference on Distributed Computing Systems (ICDCS), pp. 454–463 (2000)
Fan, R., Lynch, N.: Efficient replication of large data objects. In: Proceedings of the 17th International Symposium on Distributed Computing (DISC), pp. 75–91 (2003)
Garcia-Molina, H., Barbara, D.: How to assign votes in a distributed system. Journal of the ACM 32(4), 841–860 (1985)
Georgiou, C., Musial, P.M., Shvartsman, A.A.: Developing a consistent domain-oriented distributed object service. In: Proceedings of the 4th IEEE International Symposium on Network Computing and Applications (NCA), pp. 149–158 (2005)
Georgiou, C., Musial, P.M., Shvartsman, A.A.: Long-lived RAMBO: Trading knowledge for communication. Theoretical Computer Science 383(1), 59–85 (2007)
Georgiou, C., Nicolaou, N., Shvartsman, A.: Fault-tolerant semifast implementations for atomic read/write registers. Journal of Parallel and Distributed Computing (accepted, 2008); A preliminary version appears in SPAA 2006, pp. 281–290 (2006)
Georgiou, C., Nicolaou, N., Shvartsman, A.: On the robustness of (semi)fast quorum-based implementations of atomic shared memory(2008), http://www.cse.uconn.edu/~ncn03001/pubs/TRs/GNS08.pdf
Gifford, D.K.: Weighted voting for replicated data. In: Proceedings of the 7th ACM Symposium on Operating Systems Principles (SOSP), pp. 150–162 (1979)
Gilbert, S., Lynch, N., Shvartsman, A.: RAMBO II: Rapidly reconfigurable atomic memory for dynamic networks. In: Proceedings of the 2003 International Conference on Dependable Systems and Networks (DSN), pp. 259–268 (2003)
Gramoli, V., Anceaume, E., Virgillito, A.: SQUARE: scalable quorum-based atomic memory with local reconfiguration. In: Proceedings of the 2007 ACM Symposium on Applied Computing (SAC), pp. 574–579 (2007)
Guerraoui, R., Vukolić, M.: How fast can a very robust read be? In: Proceedings of the 25th ACM Symposium on Principles of Distributed Computing (PODC), pp. 248–257 (2006)
Guerraoui, R., Vukolić, M.: Refined quorum systems. In: Proceedings of the 26th ACM Symposium on Principles of Distributed Computing (PODC), pp. 119–128 (2007)
Lamport, L.: On interprocess communication, part I: Basic formalism. Distributed Computing 1(2), 77–85 (1986)
Lynch, N.: Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco (1996)
Lynch, N., Shvartsman, A.: RAMBO: A reconfigurable atomic memory service for dynamic networks. In: Proceedings of the 16th International Symposium on Distributed Computing (DISC), pp. 173–190 (2002)
Lynch, N., Tuttle, M.: An introduction to input/output automata. CWI-Quarterly, 219–246 (1989)
Lynch, N.A., Shvartsman, A.A.: Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts. In: Proceedings of the 27th International Symposium on Fault-Tolerant Computing (FTCS), pp. 272–281 (1997)
Malkhi, D., Reiter, M.: Byzantine quorum systems. Distributed Computing 11(4), 203–213 (1998)
Peleg, D., Wool, A.: Crumbling walls: A class of high availability quorum systems. In: Proceedings of the 14th ACM Symposium on Principles of Distributed Computing (PODC), pp. 120–129 (1995)
Shao, C., Pierce, E., Welch, J.L.: Multi-writer consistency conditions for shared memory objects. In: Proceedings of the 17th International Symposium on Distributed Computing (DISC), pp. 106–120 (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Georgiou, C., Nicolaou, N.C., Shvartsman, A.A. (2008). On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory. In: Taubenfeld, G. (eds) Distributed Computing. DISC 2008. Lecture Notes in Computer Science, vol 5218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87779-0_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-87779-0_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87778-3
Online ISBN: 978-3-540-87779-0
eBook Packages: Computer ScienceComputer Science (R0)