✦ LIBER ✦

A survey of permission-based distributed mutual exclusion algorithms

✍ Scribed by P.C. Saxena; J. Rai

Book ID: 114288273
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 304 KB
Volume: 25
Category: Article
ISSN: 0920-5489
DOI: 10.1016/s0920-5489(02)00105-8

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

A hybrid distributed mutual exclusion al

A hybrid distributed mutual exclusion algorithm

✍ Ye-In Chang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 63 KB

A queue based mutual exclusion algorithm

✍ Alex A. Aravind; Wim H. Hesselink 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 187 KB

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 token based k-resilient mutual exclusi

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

✍ Dhananjay M. Dhamdhere; Sandeep S. Kulkarni 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 664 KB

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