๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An algorithm for distributed mutual exclusion

โœ Scribed by Pranay Chaudhuri

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
782 KB
Volume
37
Category
Article
ISSN
0950-5849

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