Abstract
We present the first wait-free and self-stabilizing implementation of a single-writer/single-reader regular register by single-writer/single-reader safe registers. The construction is in two steps: one implements a regular register using 1-regular registers, and the other implements a 1-regular register using safe-registers. In both steps, if the initial register is bounded then the implementation uses only bounded registers.
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
Abraham, I., Chockler, G., Keidar, I., Malkhi, D.: Wait-free regular storage from byzantine components. Information Processing Letters 101(2), 60–65 (2007)
Abraham, U.: On interprocess communication and the implementation of multi-writer atomic registers. Theoretical Computer Science 149(2), 257–298 (1995)
Attiya, H., Welch, J.L.: Distributed computing: fundamentals, simulations and advanced topics. McGraw-Hill, Inc., New York (1998)
Dolev, S., Herman, T.: Dijkstra’s self-stabilizing algorithm in unsupportive environments. In: Datta, A.K., Herman, T. (eds.) WSS 2001. LNCS, vol. 2194, pp. 67–81. Springer, Heidelberg (2001)
Haldar, S., Vidyasankar, K.: Constructing 1-writer multireader multivalued atomic variables from regular variables. Journal of the Association of the Computing Machinery 42(1), 186–203 (1995)
Higham, L., Johnen, C.: Relationships between communication models in networks using atomic registers. In: IPDPS 2006, the 20th IEEE International Parallel & Distributed Processing Symposium (2006)
Higham, L., Johnen, C.: Self-stabilizing implementation of atomic register by regular register in networks framework. Technical Report 1449, L.R.I. (2006)
Hoepman, J.H., Papatriantafilou, M., Tsigas, P.: Self-stabilization of wait-free shared memory objects. Journal of Parallel and Distributed Computing 62(5), 818–842 (2002)
Johnen, C., Higham, L.: Self-stabilizing implementation of regular register by safe registers in link model. Technical Report 1486, L.R.I. (2008)
Lamport, L.: On interprocess communication. Distributed Computing 1(2), 77–101 (1986)
Li, M., Tromp, J., Vitanyi, P.M.B.: How to share concurrent wait-free variables. Journal of the Association of the Computing Machinery 43(4), 723–746 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Johnen, C., Higham, L. (2008). Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks. In: Garg, V., Wattenhofer, R., Kothapalli, K. (eds) Distributed Computing and Networking. ICDCN 2009. Lecture Notes in Computer Science, vol 5408. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92295-7_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-92295-7_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92294-0
Online ISBN: 978-3-540-92295-7
eBook Packages: Computer ScienceComputer Science (R0)