Abstract
In this paper, we are interested in transformations of self-stabilizing algorithms from one model to another that preserve stabilization. We propose an easy technique for proving correctness of a natural class of transformations of self-stabilizing algorithms from any model to any other. We present a new transformation of self-stabilizing algorithms from a message passing model to a shared memory model with a finite number of registers of bounded size and processors of bounded memory and prove it correct using our technique. This transformation is not wait-free, but we prove that no such transformation can be wait-free. For our transformation, we use a new self-stabilizing token-passing algorithm for the shared memory model. This algorithm stabilizes in O(n log2 n) rounds, which improves existing algorithms.
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. Efficient and robust sharing of memory in message-passing systems. In WDAG: International Workshop on Distributed Algorithms. LNCS, Springer-Verlag, 1996.
Attiya and Welch. Sequential consistency versus linearizability (extended abstract). In SPAA: Annual ACM Symposium on Parallel Algorithms and Architectures, 1991.
H. Attiya, A. Bar-Noy, and D. Dolev. Sharing memory robustly in message-passing systems. Technical Memo MIT/LCS/TM-423, Massachusetts Institute of Technology, Laboratory for Computer Science, September 1992.
Hagit Attiya and Jennifer Welch. Distributed Computing: Fundamentals, Simulations, and Advanced Topics. McGraw-Hill Publishing Company, May 1998. 6.
Amotz Bar-Noy and Danny Dolev. Shared-memory vs. message-passing in an asynchronous distributed environment. In Piotr Rudnicki, editor, Proceedings of the 8th Annual Symposium on Principles of Distributed Computing, pages 301–318, Edmonton, AB, Canada, August 1989. ACM Press.
E. W. Dijkstra. Self-stabilizing systems in spite of distributed control. Communications of the Association for Computing Machinery, 17(11):643–644, November 1974.
Dolev, Israeli, and Moran. Self-stabilization of dynamic systems assuming only read/write atomicity. DISTCOMP: Distributed Computing, 7, 1994.
Shlomi Dolev. Self-Stabilization. MIT Press, Cambridge, MA, 2000. Ben-Gurion University of the Negev, Israel.
Shlomi Dolev, Amos Israeli, and Shlomo Moran. Resource bounds for self-stabilizing message-driven protocols. SIAM Journal on Computing, 26(1):273–290, February 1997.
Kleoni Ioannidou. Self-Stabilizing Transformations Between Message Passing and Shared Memory Models. Master Thesis, Department of Computer Science of University of Toronto, 2001.
Katz and Perry. Self-stabilizing extensioins for message-passing systems. DISTCOMP: Distributed Computing, 7, 1994.
Lynch and Vaandrager. Forward and backward simulations for timing-based systems. In REX: Real-Time: Theory in Practice, REX Workshop, 1991.
Nancy Lynch. Distributed Algorithms. Morgan Kaufmann, San Francisco, CS, 1996. MIT.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ioannidou, K. (2002). Transformations of Self-Stabilizing Algorithms. In: Malkhi, D. (eds) Distributed Computing. DISC 2002. Lecture Notes in Computer Science, vol 2508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36108-1_7
Download citation
DOI: https://doi.org/10.1007/3-540-36108-1_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00073-0
Online ISBN: 978-3-540-36108-4
eBook Packages: Springer Book Archive