𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fair mutual exclusion on a graph of processes

✍ Scribed by Jan L. A. van de Snepscheut

Publisher
Springer-Verlag
Year
1987
Tongue
English
Weight
255 KB
Volume
2
Category
Article
ISSN
0178-2770

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Mutual Exclusion on a Hypercube
Mutual Exclusion on a Hypercube
✍ Ajay Gupta; Steven c. Bruell; Sukumar Ghosh πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 793 KB
Uniform and Self-Stabilizing Fair Mutual
Uniform and Self-Stabilizing Fair Mutual Exclusion on Unidirectional Rings under Unfair Distributed Daemon
✍ Hirotsugu Kakugawa; Masafumi Yamashita πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 180 KB

This paper presents a uniform randomized self-stabilizing mutual exclusion algorithm for an anonymous unidirectional ring of any size n, running under an unfair distributed scheduler (d-daemon). The system is stabilized with probability 1 in Oðn 3 Þ expected number of steps, and each process is priv

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