𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A token based k-resilient mutual exclusion algorithm for distributed systems

✍ Scribed by Dhananjay M. Dhamdhere; Sandeep S. Kulkarni

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
664 KB
Volume
50
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Empirical Evaluation of Mutual Exclusion
Empirical Evaluation of Mutual Exclusion Algorithms for Distributed Systems
✍ Shiwa S. Fu; Nian-Feng Tzeng; Jen-Yao Chung πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 270 KB

Mutual exclusion in distributed memory systems is realized by passing messages among sites to establish a sequence for the waiting sites to enter the critical section. We have evaluated various distributed mutual exclusion algorithms on the IBM SP2 machine and the Intel iPSCΓ‚860 system, with their e

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