Local Synchronization on Oriented Rings
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.
KeywordsLocal mutual exclusion transformer oriented ring self-stabilization synchronization
Unable to display preview. Download preview PDF.
- 6.Gouda, M.G.: The Stabilizing Philospher: Asymmetry by Memory and by Action. Tech. Report TR-87-12. University of Texas at Austin (1987)Google Scholar
- 7.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)Google Scholar