Abstract
By presenting a message-efficient snap-stabilizing quiescence detection algorithm, we also facilitate a transformer that converts non self-stabilizing algorithms into self-stabilizing ones. We propose a message-efficient snap-stabilizing ongoing quiescence detection algorithm. (Notice that by definition it is also self-stabilizing and can detect termination.) This algorithm works for diffusing computations. We are not aware of any other self-stabilizing or snap-stabilizing ongoing quiescence or termination detection algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Snap-stabilization [8] is a variant of self-stabilization that ensures immediate recovery after transient faults. Notice that a snap-stabilizing algorithm is also self-stabilizing.
- 2.
In a diffusing computation, a unique process, the initiator, can spontaneously send a message to one or more of its neighbors and only once [12]. After receiving their first message, the other processes can freely send messages to their neighbors.
- 3.
In a k-synchronous execution, the difference of speed between any two processes is at most k.
References
Afek, Y., Brown, G.M.: Self-stabilization over unreliable communication media. Distrib. Comput. 7(1), 27–34 (1993)
Afek, Y., Kutten, S., Yung, M.: The local detection paradigm and its application to self-stabilization. Theor. Comput. Sci. 186(1–2), 199–229 (1997)
Awerbuch, B., Kutten, S., Mansour, Y., Patt-Shamir, B., Varghese, G.: Time optimal self-stabilizing synchronization. In: STOC 1993, pp. 652–661 (1993)
Awerbuch, B., Patt-Shamir, B., Varghese, G.: Self-stabilization by local checking and correction (extended abstract). In: FOCS 1991, pp. 268–277 (1991)
Awerbuch, B., Patt-Shamir, B., Varghese, G., Dolev, S.: Self-stabilization by local checking and global reset. In: Tel, G., Vitányi, P. (eds.) WDAG 1994. LNCS, vol. 857, pp. 326–339. Springer, Heidelberg (1994). https://doi.org/10.1007/BFb0020443
Awerbuch, B., Varghese, G.: Distributed program checking: a paradigm for building self-stabilizing distributed protocols. In: FOCS 1991, pp. 258–267 (1991)
Boulinier, C., Petit, F., Villain, V.: When graph theory helps self-stabilization. PODC 2004, 150–159 (2004)
Bui, A., Datta, A.K., Petit, F., Villain, V.: State-optimal snap-stabilizing PIF in tree networks. In: WSS 1999, pp. 78–85 (1999)
Chandy, K.M., Misra, J.: An example of stepwise refinement of distributed programs: quiescence detection. ACM TOPLAS 8(3), 326–343 (1986)
Cournier, A., Datta, A.K., Devismes, S., Petit, F., Villain, V.: The expressive power of snap-stabilization. Theor. Comput. Sci. 626, 40–66 (2016)
Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643–644 (1974)
Dijkstra, E.W., Scholten, C.S.: Termination detection for diffusing computations. Inf. Process. Lett. 11(1), 1–4 (1980)
Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)
Francez, N.: Distributed termination. ACM TOPLAS 2(1), 42–55 (1980)
Francez, N., Rodeh, M., Sintzoff, M.: Distributed termination with interval assertions. In: Díaz, J., Ramos, I. (eds.) ICFPC 1981. LNCS, vol. 107, pp. 280–291. Springer, Heidelberg (1981). https://doi.org/10.1007/3-540-10699-5_105
Hendler, D., Kutten, S.: Bounded-wait combining: constructing robust and high-throughput shared objects. Distrib. Comput. 21(6), 405–431 (2009)
Katz, S., Perry, K.J.: Self-stabilizing extensions for message-passing systems. Distrib. Comput. 7(1), 17–26 (1993)
Korman, A., Kutten, S., Masuzawa, T.: Fast and compact self-stabilizing verification, computation, and fault detection of an MST. In: PODC 2011, pp. 311–320 (2011)
Korman, A., Kutten, S., Peleg, D.: Proof labeling schemes. Distrib. Comput. 22(4), 215–233 (2010)
Peleg, D.: Distributed Computing: A Locality-sensitive Approach. Society for Industrial and Applied Mathematics (2000)
Shavit, N., Francez, N.: A new approach to detection of locally indicative stability. In: Kott, L. (ed.) ICALP 1986. LNCS, vol. 226, pp. 344–358. Springer, Heidelberg (1986). https://doi.org/10.1007/3-540-16761-7_84
Acknowledgement
This research was carried with a partial support of the Israel Ministry of Science and Technology.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Durand, A., Kutten, S. (2018). Message-Efficient Self-stabilizing Transformer Using Snap-Stabilizing Quiescence Detection. In: Lotker, Z., Patt-Shamir, B. (eds) Structural Information and Communication Complexity. SIROCCO 2018. Lecture Notes in Computer Science(), vol 11085. Springer, Cham. https://doi.org/10.1007/978-3-030-01325-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-01325-7_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-01324-0
Online ISBN: 978-3-030-01325-7
eBook Packages: Computer ScienceComputer Science (R0)