Abstract
In this work, we investigate the problem of resolving conflicts in a distributed environment using only local knowledge. The contribution of this paper is twofold. First, we present a self-stabilizing algorithm to deal with this problem. Self-stabilizing algorithms protect against transient failures. The second result gives a particular implementation and analysis based on probabilistic procedures. Thus, the stabilization time is computed in terms of computation steps, then approximated according to the needed synchronizations.
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
Chandy, K.M., Misra, J.: The drinking philosophers problem. ACM Transactions on Programming Languages and Systems 6(4), 632–646 (1984)
Dijkstra, E.W.: Hierarchical ordering of sequential processes. In: Hoare, C.A.R., Perrott, R.H. (eds.) Operating Systems Techniques, Academic Press, London (1972)
Welch, J.L., Lynch, N.A.: A modular drinking philosophers algorithm. Distributed Computing 6(4), 233–244 (1993)
Barbosa, V.C., Benevides, M.R.F., Oliveira Filho, A.L.: A priority dynamics for generalized drinking philosophers. Information Processing Letters 79, 189–195 (2001)
Dijkstra, E.W.: Self stabilizing systems in spite of distributed control. Communications of the ACM 17(11), 643–644 (1974)
Lamport, L.: A new solution of dijkstra’s concurrent programming problem. Commun. ACM 17(8), 453–455 (1974)
Lehmann, D.J., Rabin, M.O.: On the advantages of free choice: A symmetric and fully distributed solution to the dining philosophers problem. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 133–138 (1981)
Duflot, M., Fribourg, L., Picaronny, C.: Randomized dining philosophers without fairness assumption. In: International Conference on Theoretical Computer Science TCS, pp. 169–180 (2002)
Herman, T.: Probabilistic self-stabilization. Inf. Process. Lett. 35(2), 63–67 (1990)
Mosbah, M., Sellami, A., Zemmari, A.: Using graph relabeling systems for resolving conflicts. In: New Technologies for Distributed Systems (NOTERE’2006), Lavoisier, Hermes, pp. 283–294 (June 2006)
Hamid, B., Mosbah, M.: An automatic approach to self-stabilization. In: 6th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2005), Baltimore, USA, pp. 123–128. IEEE Computer Society, Los Alamitos (2005)
Litovsky, I., Métivier, Y., Sopena, E.: Graph relabeling systems and distributed algorithms. In: Ehrig, H., Kreowski, H.J., Montanari, U., Rozenberg, G. (eds.) Handbook of graph grammars and computing by graph transformation, vol. III, pp. 1–56. World Scientific Publishing, Singapore (1999)
Métivier, Y., Saheb, N., Zemmari, A.: Randomized local elections. Inf. Process. Lett. 82(6), 313–320 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hamid, B., Mosbah, M., Zemmari, A. (2007). A Self-stabilizing Distributed Algorithm for Resolving Conflicts. In: Meersman, R., Tari, Z., Herrero, P. (eds) On the Move to Meaningful Internet Systems 2007: OTM 2007 Workshops. OTM 2007. Lecture Notes in Computer Science, vol 4806. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76890-6_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-76890-6_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76889-0
Online ISBN: 978-3-540-76890-6
eBook Packages: Computer ScienceComputer Science (R0)