𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Distributed mutual exclusion on a ring of processes

✍ Scribed by Alain J. Martin

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
638 KB
Volume
5
Category
Article
ISSN
0167-6423

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Taxonomy of Distributed Mutual Exclusi
A Taxonomy of Distributed Mutual Exclusion
✍ M. Singhal πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 743 KB

In this paper, we present a taxonomy of mutual exclusion in distributed systems where there is no shared memory and all communication is solely by passing messages. We classify these algorithms based upon their distinct features, as well as unify them based on their commonalities. Such classificatio

A Log (N) Distributed Mutual Exclusion A
A Log (N) Distributed Mutual Exclusion Algorithm Based on Path Reversal
✍ Mohamed Naimi; Michel Trehel; AndrΓ© Arnold πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 378 KB

Several algorithms reducing the number of messages were presented later (see Ricart and Agrawala [21] and Carvalho and Roucairol [4]). The number of messages was proportional to N. The algorithm presented by Chandy and Misra [6] (in which permission is in the form of a fork) is the most efficient of

A Quorum-Based Self-Stabilizing Distribu
A Quorum-Based Self-Stabilizing Distributed Mutual Exclusion Algorithm
✍ Mikhail Nesterenko; Masaaki Mizuno πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 187 KB

In this paper, we present a self-stabilizing quorum-based distributed mutual exclusion algorithm. Our algorithm is designed for an asynchronous message-passing model. The algorithm scales well since it has constant synchronization delay and its message complexity is proportional to the square root o