Uniform and self-stabilizing fair mutual exclusion on unidirectional rings under unfair distributed daemon

Authors:
Hirotsugu Kakugawa;Masafumi Yamashita
Affiliations:
Department of Information Engineering, Faculty of Engineering, Hiroshima University, 1-4-1 Kagamiyama, Higashi-Hiroshima, Japan;Department of Computer Science and Communication Engineering, Kyushu University, 6-10-1 Hakozaki, Higashi, Fukuoka, Japan
Venue:
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Year:
2002

Citing 17
Cited 4

An exercise in proving self-stabilization with a variant function

Information Processing Letters
Uniform self-stabilizing rings

ACM Transactions on Programming Languages and Systems (TOPLAS)
Probabilistic self-stabilization

Information Processing Letters
Token management schemes and random walks yield self-stabilizing mutual exclusion

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Observing self-stabilization

PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Self-stabilization

ACM Computing Surveys (CSUR)
Collisions among random walks on a graph

SIAM Journal on Discrete Mathematics
Probabilistic self-stabilizing mutual exclusion in uniform rings

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Randomized algorithms

Randomized algorithms
The stabilizing token ring in three bits

Journal of Parallel and Distributed Computing
Uniform and Self-Stabilizing Token Rings Allowing Unfair Daemon

IEEE Transactions on Parallel and Distributed Systems
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Selected writings on computing: a personal perspective

Selected writings on computing: a personal perspective
A Timestamp Based Transformation of Self-Stabilizing Programs for Distributed Computing Environments

WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Mutual Exclusion Between Neighboring Nodes in an Arbitrary System Graph Tree That Stabilizes Using Read/Write Atomicity

Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Mutual Exclusion Between Neighboring Nodes in a Tree That Stabilizes Using Read/Write Atomicity

Euro-Par '98 Proceedings of the 4th International Euro-Par Conference on Parallel Processing
Self-stabilizing extensions for message-passing systems

Distributed Computing - Special issue: Self-stabilization

A space-efficient self-stabilizing algorithm for measuring the size of ring networks

Information Processing Letters
Analysis of an Intentional Fault Which Is Undetectable by Local Checks under an Unfair Scheduler

SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A space-efficient self-stabilizing algorithm for measuring the size of ring networks

Information Processing Letters
Introducing speculation in self-stabilization: an application to mutual exclusion

Proceedings of the 2013 ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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(n3) expected number of steps, and each process is privileged at least once in every 2n steps, once it is stabilized.