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

A highly safe self-stabilizing mutual exclusion algorithm

โœ Scribed by I-Ling Yen

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
512 KB
Volume
57
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

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