Lock-based self-stabilizing distributed mutual exclusion algorithms

Authors:
Affiliations:
Venue:
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Year:
1996

Citing 0
Cited 8

Resettable vector clocks

Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
A quorum-based self-stabilizing distributed mutual exclusion algorithm

Journal of Parallel and Distributed Computing
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
Stabilization-Preserving Atomicity Refinement

Proceedings of the 13th International Symposium on Distributed Computing
Resettable vector clocks

Journal of Parallel and Distributed Computing
On the performance of distributed lock-based synchronization

ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
On the performance of distributed lock-based synchronization?

ACM SIGOPS Operating Systems Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

In 1974, Dijkstra introduced the notion of self-stabilization and presented a token circulation distributed mutual exclusion (DMX) protocol as the first self-stabilizing (SS) algorithm. Since then, many variations of SS DMX algorithms have been presented. Most, if not all, of these algorithms impose stronger assumptions on their execution environments than those provided by common distributed systems. Independently, non SS DMX algorithms have been studied extensively in the last 15 years. This paper presents two SS DMX algorithms that are based on existing non SS DMX algorithms: one is based on a link-locking algorithm and the other is on a node-locking algorithm. Our algorithms assume execution environments that are close to those provided by common distributed systems. Furthermore, they provide better synchronization delays than token circulation SS DMX algorithms. We have implemented our algorithms and tested them with various initial configurations.