article

Self-stabilization of dynamic systems assuming only read/write atomicity

Authors:

Shlomo MoranAuthors Info & Claims

Distributed Computing, Volume 7, Issue 1

Pages 3 - 16

https://doi.org/10.1007/BF02278851

Published: 01 November 1993 Publication History

Abstract

Three self-stabilizing protocols for distributed systems in the shared memory model are presented. The first protocol is a mutual-exclusion protocol for tree structured systems. The second protocol is a spanning tree protocol for systems with any connected communication graph. The third protocol is obtained by use of fair protocol combination, a simple technique which enables the combination of two self-stabilizing dynamic protocols. The result protocol is a self-stabilizing, mutual-exclusion protocol for dynamic systems with a general (connected) communication graph. The presented protocols improve upon previous protocols in two ways: First, it is assumed that the only atomic operations are either read or write to the shared memory. Second, our protocols work for any connected network and even for dynamic networks, in which the topology of the network may change during the execution.

References

[1]

1. Brown GM, Gouda MG, Wu CL: A self-stabilizing token system. In: Proc 20th Annual Hawaii International Conference on System sciences, pp 218-223, 1987.

[2]

2. Burns JE, Pachl J: Uniform self-stabilizing rings, ACM Trans Program Lang Syst 1(2): 330-344 (1989).

Digital Library

[3]

3. Burns JE: Self-stabilizing rings without demons. Tech Rep GIT-ICS-87/36, Georgia Institute of Technology, 1987.

[4]

4. Dijkstra, EW: Self-stabilizing systems in spite of distributed control. Commun ACM 17(11): 643-644 (1974).

Digital Library

[5]

5. Dijkstra EW: Self-stabilizing systems in spite of distributed control (EWD 391). Reprinted in: Selected writing on computing: a personal perspective. Springer, Berlin Heidelberg New York 1982, pp 41-46.

[6]

6. Dijkstra EW: A belated proof of self-stabilizion. Distrib Comput 1(1): 5-6 (1986).

Digital Library

[7]

7. Dolev S, Israeli A, Moran S: Self-stabilization of dynamic systems assuming only read/write atomicity (preliminary version) Proc MCC Workshop on Self-Stabilization, Austin, Texas, November 1989. Also in: Proc 9th Annual ACM Symposium on Principles of Distributed Computing, pp 103-117, 1990.

[8]

8. Israeli A, Jalfon M: Token management schemes and random walks yield self-stabilizing mutual exclusion. In: Proc 9th Annual ACM Symposium on Principles of Distributed Computing, pp 119-131, 1990.

Digital Library

[9]

9. Israeli A, Jalfon M: Uniform self-stabilizing ring orientation. Inf Comput 104: 175-196 (1993). Also in: Van Leeuwen J, Santoro N (eds) Distributed Algorithms (Proceedings of the Fourth International Workshop on Distributed Algorithms, Bari, Italy, September 1990). Lect Notes Comput Sci, vol 486. Springer, Berlin Heidelberg New York 1991, pp 1-14.

Digital Library

[10]

10. Katz S, Perry KJ: Self-stabilizing extensions for message-passing systems. Distrib Comput 7: 17-26 (1993). Also in: Proc 9th Annual ACM Symposium on Principles of Distributed Computing, pp 91-101, 1990.

Digital Library

[11]

11. Kruijer HSM: Self-stabilizion (in spite of distributed control) in tree-structured systems. Inf Process Lett 8(2): 91-95 (1979).

[12]

12. Loui MC, Abu-Amara HH: Memory requirements for agreement among unreliable asynchronous processes. In: Preparata FP (ed) Advances in computing research. JAI Press 1987, pp 163-183.

[13]

13. Peterson GL, Fischer MJ: Economical solutions for the critical section problem in a distributed system. In: Proc ACM Symposium on Theory of Computing, pp 91-97, 1977.

[14]

14. Tajibnapis WP: A correctness proof of a topology information maintenance protocol for a distributed computer network. Commun ACM 20(7): 477-485 (1977).

Digital Library

[15]

15. Tanenbaum AS: Computer networks. Prentice-Hall, 1981, pp 205-231.

[16]

16. Tchuente M: Sur l'auto-stabilisation dans un r'eseau d'ordinateurs, RAIRO Inf Theor 15: 47-66 (1981).

Cited By

Johnen CDevismes SMazoit FIlcinkas DKuznetsov PGelles ROlivetti D(2024)Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficientProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662803(538-548)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662803
Blin LLe Bouder GPetit F(2024)Optimal Memory Requirement for Self-stabilizing Token CirculationStructural Information and Communication Complexity10.1007/978-3-031-60603-8_6(101-118)Online publication date: 27-May-2024
https://dl.acm.org/doi/10.1007/978-3-031-60603-8_6
Nguyen DGupta AKulkarni S(2023)Analyzing Program Transitions to Compute Benefit of Tolerating Consistency Violation FaultsProceedings of the 24th International Conference on Distributed Computing and Networking10.1145/3571306.3571391(58-69)Online publication date: 4-Jan-2023
https://dl.acm.org/doi/10.1145/3571306.3571391
Show More Cited By

Index Terms

Self-stabilization of dynamic systems assuming only read/write atomicity

Recommendations

Correctness of Self-Stabilizing Algorithms Under the Dolev Model When Adapted to Composite Atomicity Models

In this paper, the authors first clarify that it is not a trivial matter whether or not a self-stabilizing algorithm under the Dolev model, when adapted to a composite atomicity model, is also self-stabilizing. Then the authors employ a particular "...
Quasi-self-stabilization of a distributed system assuming read/write atomicity

Self-stabilizing systems of the Dolev type were first introduced by Dolev et al. in their famous paper in 1993. In contrast to self-stabilizing systems of the Dijkstra type, such self-stabilizing systems assume the read/write atomicity model instead of ...
Fault-containing self-stabilizing distributed protocols

Self-stabilization is an elegant approach for designing a class of fault-tolerant distributed protocols. A self-stabilizing protocol is guaranteed to eventually converge to a legitimate state after a transient fault. However, even a minor transient ...

Comments

Information & Contributors

Information

Published In

cover image Distributed Computing

Distributed Computing Volume 7, Issue 1

Special issue: Self-stabilization

November 1993

63 pages

ISSN:0178-2770

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 November 1993

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

98
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Johnen CDevismes SMazoit FIlcinkas DKuznetsov PGelles ROlivetti D(2024)Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficientProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662803(538-548)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662803
Blin LLe Bouder GPetit F(2024)Optimal Memory Requirement for Self-stabilizing Token CirculationStructural Information and Communication Complexity10.1007/978-3-031-60603-8_6(101-118)Online publication date: 27-May-2024
https://dl.acm.org/doi/10.1007/978-3-031-60603-8_6
Nguyen DGupta AKulkarni S(2023)Analyzing Program Transitions to Compute Benefit of Tolerating Consistency Violation FaultsProceedings of the 24th International Conference on Distributed Computing and Networking10.1145/3571306.3571391(58-69)Online publication date: 4-Jan-2023
https://dl.acm.org/doi/10.1145/3571306.3571391
Altisen KDevismes SDurand AJohnen CPetit F(2023)Self-stabilizing systems in spite of high dynamicsTheoretical Computer Science10.1016/j.tcs.2023.113966964:COnline publication date: 10-Jul-2023
https://dl.acm.org/doi/10.1016/j.tcs.2023.113966
Datta ADevismes SJohnen CLarmore L(2023)Analysis of a memory-efficient self-stabilizing BFS spanning tree constructionTheoretical Computer Science10.1016/j.tcs.2023.113804955:COnline publication date: 1-May-2023
https://dl.acm.org/doi/10.1016/j.tcs.2023.113804
Michail OSpirakis PTheofilatos M(2023)Fault tolerant network constructorsInformation and Computation10.1016/j.ic.2023.105037292:COnline publication date: 1-Jun-2023
https://dl.acm.org/doi/10.1016/j.ic.2023.105037
Herman T(2022)Origin of Self-StabilizationEdsger Wybe Dijkstra10.1145/3544585.3544592(81-104)Online publication date: 12-Jul-2022
https://dl.acm.org/doi/10.1145/3544585.3544592
Altisen KDevismes SDurand AJohnen CPetit FMiller ACensor-Hillel K(2021)On Implementing Stabilizing Leader Election with Weak Assumptions on Network DynamicsProceedings of the 2021 ACM Symposium on Principles of Distributed Computing10.1145/3465084.3467917(21-31)Online publication date: 21-Jul-2021
https://dl.acm.org/doi/10.1145/3465084.3467917
Burman JChen HChen HDoty DNowak TSeverson EXu CMiller ACensor-Hillel K(2021)Time-Optimal Self-Stabilizing Leader Election in Population ProtocolsProceedings of the 2021 ACM Symposium on Principles of Distributed Computing10.1145/3465084.3467898(33-44)Online publication date: 21-Jul-2021
https://dl.acm.org/doi/10.1145/3465084.3467898
Altisen KDevismes SDurand AJohnen CPetit F(2021)Self-stabilizing Systems in Spite of High DynamicsProceedings of the 22nd International Conference on Distributed Computing and Networking10.1145/3427796.3427838(156-165)Online publication date: 5-Jan-2021
https://dl.acm.org/doi/10.1145/3427796.3427838
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents