Abstract
We consider the local mutual exclusion (LME) problem on a ring network. We present two self-stabilizing distributed algorithms, with local mutual exclusion, for the dining philosophers problem on a bidirectional oriented ring with two distinguished processes. The first algorithm, which uses the composite atomicity model, works under an unfair distributed daemon. The second algorithm, which uses the read-write atomicity model, works under a weakly fair daemon. Both algorithms use at most two extra bits per process to enforce local mutual exclusion. Both algorithms are derived from a simpler algorithm using transformations which can be applied to other algorithms on the ring. The technique can be generalized to more complex topologies.
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
Nesterenko, M., Arora, A.: Stabilization-Preserving Atomicity Refinement. Journal of Parallel and Distributed Computing 62, 766–791 (2002)
Dijkstra, E.W.: Hierarchical Ordering of Sequential Processes. Acta Informatica 1, 115–138 (1971)
Dijkstra, E.W.: Self Stabilizing Systems in Spite of Distributed Control. Communications of ACM 17, 643–644 (1974)
Dolev, S., Israeli, A., Moran, S.: Self-stabilization of Dynamic Dystems Dssuming Dnly Dead/write Dtomicity. Distributed Computing 7, 3–16 (1993)
Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)
Gouda, M.G.: The Stabilizing Philospher: Asymmetry by Memory and by Action. Tech. Report TR-87-12. University of Texas at Austin (1987)
Gouda, M.G., Haddix, F.F.: The Linear Alternator. In: Proceedings of the 3rd Workshop on Self-stabilizing Systems, pp. 31–47. Carleton University Press (1997)
Gouda, M.G., Haddix, F.F.: The Alternator. Distributed Computing 20, 21–28 (2007)
Huang, S.T.: The fuzzy philosophers. In: Rolim, J.D.P. (ed.) IPDPS-WS 2000. LNCS, vol. 1800, pp. 130–136. Springer, Heidelberg (2000)
Hoover, D., Poole, J.: A Distributed Self-stabilizing Solution For the Dining Philosophers Problem. IPL 41, 209–213 (1989)
Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bein, D., Datta, A.K., Gupta, C.K., Larmore, L.L. (2008). Local Synchronization on Oriented Rings. In: Kulkarni, S., Schiper, A. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2008. Lecture Notes in Computer Science, vol 5340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89335-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-89335-6_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89334-9
Online ISBN: 978-3-540-89335-6
eBook Packages: Computer ScienceComputer Science (R0)