Abstract
Implementing atomic read/write shared objects in a message-passing system is an important problem in distributed computing. Considering that communication is the most expensive resource, efficiency of read and write operations is assessed primarily in terms of the needed communication and the associated latency. Attiya, Bar-Noy, and Dolev established that two communication round-trip phases involving in total four message exchanges are sufficient to implement atomic operations when a majority of processors are correct. Subsequently Dutta et al. showed that one round involving two communication exchanges is sufficient as long as the system adheres to certain constraints with respect to crashes on the number of readers and writers in the system. It was also observed that three exchanges are sufficient in some settings.
This extended abstract presents work that explores algorithms where operations are able to complete in three message exchanges without imposing constraints on the number of participants, i.e., the aim is One and half Round Atomic Memory, hence the name Oh-RAM! Recently Hadjistasi et al. showed that three-exchange implementations are impossible in the MWMR (multi-writer/multi-reader) setting. This paper shows that this is achievable in the SWMR (single-writer/multi-reader) setting, and also achievable for read operations in the MWMR setting by “sacrificing” the performance of write operations. In particular, a SWMR implementation is presented, where reads complete in three and writes complete in two exchanges. Next, a MWMR implementation is given, where reads involve three and writes involve four exchanges. In light of the impossibility result these algorithms are optimal in terms of the number of communication exchanges. Both algorithms are then refined to allow some reads to complete in just two exchanges. These algorithms are evaluated and compared using the NS3 simulator with different topologies and operation loads.
Supported in part by FP7-PEOPLE-2013-IEF grant ATOMICDFS No: 629088.
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
Similar content being viewed by others
References
NS3 network simulator. https://www.nsnam.org/
Attiya, H., Bar-Noy, A., Dolev, D.: Sharing memory robustly in message passing systems. J. ACM 42(1), 124–142 (1996)
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., Georgiou, C., Musial, P.M., Nicolaou, N., Shvartsman, A.A.: On the efficiency of atomic multi-reader, multi-writer distributed memory. In: Abdelzaher, T., Raynal, M., Santoro, N. (eds.) OPODIS 2009. LNCS, vol. 5923, pp. 240–254. Springer, Heidelberg (2009). doi:10.1007/978-3-642-10877-8_20
Georgiou, C., Nicolaou, N.C., Shvartsman, A.A.: Fault-tolerant semifast implementations of atomic read/write registers. J. Parallel Distrib. Comput. 69(1), 62–79 (2009)
Hadjistasi, T., Nicolaou, N., Schwarzmann, A.A.: Oh-Ram! one and a half round atomic memory (2016). arXiv:1610.08373
Hadjistasi, T., Nicolaou, N., Schwarzmann, A.A.: On the impossibility of one-and-a-half round atomic memory (2016). www.arXiv.com
Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. (TOPLAS) 12(3), 463–492 (1990)
Lamport, L.: How to make a multiprocessor computer that correctly executes multiprocess program. IEEE Trans. Comput. 28(9), 690–691 (1979)
Lynch, N.: Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco (1996)
Lynch, N.A., Shvartsman, A.A.: Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts. In: Proceedings of Symposium on Fault-Tolerant Computing, pp. 272–281 (1997)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Hadjistasi, T., Nicolaou, N., Schwarzmann, A.A. (2017). Oh-RAM! One and a Half Round Atomic Memory. In: El Abbadi, A., Garbinato, B. (eds) Networked Systems. NETYS 2017. Lecture Notes in Computer Science(), vol 10299. Springer, Cham. https://doi.org/10.1007/978-3-319-59647-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-59647-1_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-59646-4
Online ISBN: 978-3-319-59647-1
eBook Packages: Computer ScienceComputer Science (R0)