Local Synchronization on Oriented Rings

Authors:
Doina Bein;Ajoy K. Datta;Chitwan K. Gupta;Lawrence L. Larmore
Affiliations:
University of Texas at Dallas, USA;University of Nevada, Las Vegas, USA;University of Nevada, Las Vegas, USA;University of Nevada, Las Vegas, USA
Venue:
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Year:
2008

Citing 8
Cited 0

A distributed self-stabilizing solution to the dining philosophers problem

Information Processing Letters
Self-stabilization

Self-stabilization
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Distributed Algorithms

Distributed Algorithms
Stabilization-preserving atomicity refinement

Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
The Fuzzy Philosophers

IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
The Stabilizing Philosopher: Asymmetry by Memory and by Action

The Stabilizing Philosopher: Asymmetry by Memory and by Action
Self-stabilization of dynamic systems assuming only read/write atomicity

Distributed Computing - Special issue: Self-stabilization

Quantified Score

Hi-index	0.00

Visualization

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.