Abstract
In [13,14,7], the modeling of silent tasks by means of so-called r-operators has been studied, and interesting relations have been shown between algebraic properties of a given operator and stabilizing properties of the related distributed algorithms. Modeling algorithms with algebraic operators allows to determine generic results for a wide set of distributed algorithms. Moreover, by simply checking some local algebraic properties, some global properties can be deduced. Stabilizing properties of shortest path calculus, depth-first-search tree construction, best reliable transmitters, best capacity paths, ordered ancestors list... have hence been established by simply reusing generic proofs, either in the read-write shared register models [13,14] or in the unreliable message passing models [7]. However, while this approach is promising, it may be penalized by the difficulty in designing new r-operators.
In this paper, we present the fundation of the r-operators by introducing a generalization of the idempotent semi-groups, called r-semi-group. We establish the requirements on the operators to be used in distributed computation and we show that the r-semi-groups fulfill them. We investigate the connections between semi-groups and r-semi-groups, in order to ease the design of r-operators. We then show how to build new r-operators, to solve new algorithmic problems.
With these new results, the r-semi-groups appear to be a powerful tool to design stabilizing silent tasks.
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
Afek, Y., Bremler, A.: Self-stabilizing unidirectional network algorithms by power supply. Chicago Journal of Theoretical Computer Science 4(3), 1–48 (1998)
Aho, A., Hopcropft, J., Ullman, J.: The Design and Analysis of Computer Algorithms. In: Series in Computer Science and Information Processing, Addison-Wesley Publishing, Reading (1974)
Arora, A., Attie, P., Evangelist, M., Gouda, M.: Convergence of iteration systems. Distributed Computing 7, 43–53 (1993)
Baccelli, F., Cohen, G., Olsder, G., Quadrat, J.-P.: Synchronization and Linearity, an algebra for discrete event systems. In: Series in Probability and Mathematical Statistics, Wiley, Chichester (1992)
Bilardi, G., Preparata, F.: Characterization of associative operations with prefix circuits of constant depth and linear size. SIAM Journal of Computing 19(2), 246–255 (1990)
Bourbaki, N.: Algèbre. In: Éléments de Mathématiques, 2nd edn. Hermann, Paris.(Fascicule IV, Livre II) (1964)
Delaët, S., Ducourthial, B., Tixeuil, S.: Self-stabilization with r-operators revisited. Journal of Aerospace Computing, Information, and Computation, A previous version appeared in SSS’2005, Barcelona (2006)
Dolev, S.: Self-stabilization. MIT Press, Cambridge (2000)
Dolev, S., Israeli, A., Moran, S.: Self stabilization of dynamic systems assuming only read/write atomicity. Distributed Computing 7, 3–16 (1993)
Ducourthial, B.: New operators for computing with associative nets. In: Proc. of SIROCCO 1998, Amalfi, Italy, pp. 55–65. Carleton Scientific (1998)
Ducourthial, B.: r-semi-groups. Technical report, Heudiasyc UMR CNRS 6599, UTC, 2006. http://www.hds.utc.fr/~ducourth/bib/rap-rsemigroups-BDucourthial.pdf
Ducourthial, B., Sicard, N., Mérigot, A.: Efficient neighborhood-based computations on regions using scans. In: Proceeding of IEEE ICIP 2005, IEEE Computer Society Press, Los Alamitos (2005)
Ducourthial, B., Tixeuil, S.: Self-stabilization with r-operators. Distrib. Comp. 14(3), 147–162 (2001)
Ducourthial, B., Tixeuil, S.: Self-stabilization with path algebra. Theoretical Computer Science (Special issue on max-plus algebra)1(293), 219–236 (2003)
Gondran, M., Minoux, M.: Graphes et Algorithmes. Eyrolles, Paris (1979)
Gouda, M.G.: The triumph and tribulation of system stabilization. In: Helary, J.-M., Raynal, M. (eds.) WDAG 1995. LNCS, vol. 972, pp. 1–18. Springer, Heidelberg (1995)
Gouda, M.G., Schneider, M.: Maximizable routing metrics. IEEE/ACM Transaction on Networking 11(4), 663–675 (2003)
Israeli, A., Jalfon, M.: Uniform self-stabilizing ring orientation. Inform. and Comput. 104, 175–196 (1993)
Oehlerking, J., Dhama, A., Theel, O.: Towards automatic convergence verification of self-stabilizing algorithms. In: Tixeuil, S., Herman, T. (eds.) SSS 2005. LNCS, vol. 3764, Springer, Heidelberg (2005)
Tel, G.: Topics in Distributed Algorithms. In: Cambridge International Series on Parallel Computation, vol. 1, Cambridge University Press, Cambridge (1991)
Theel, O.: Exploitation of Ljapunov theory for verifying self-stabilizing algorithms. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol. 1914, Springer, Heidelberg (2000)
Tsai, M.S., Huang, S.T.: A self-stabilizing algorithm for the shortest paths problem with a fully distributed demon. Parallel Proc. Letters 4(1-2), 65–72 (1994)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ducourthial, B. (2007). r-Semi-Groups: A Generic Approach for Designing Stabilizing Silent Tasks. In: Masuzawa, T., Tixeuil, S. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2007. Lecture Notes in Computer Science, vol 4838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76627-8_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-76627-8_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76626-1
Online ISBN: 978-3-540-76627-8
eBook Packages: Computer ScienceComputer Science (R0)