Self-stabilization: randomness to reduce space

Authors:
Ted Herman
Affiliations:
Department of Computer Sciences, University of Texas at Austin, Austin, TX
Venue:
Distributed Computing
Year:
1992

Citing 3
Cited 4

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
Self-stabilizing systems in spite of distributed control

Communications of the ACM

Two-State Self-Stabilizing Algorithms for Token Rings

IEEE Transactions on Software Engineering
Cooperating Mobile Agents and Stabilization

WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Self-Stabilizing Mutual Exclusion in the Presence of Faulty Nodes

FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Brief announcement: optimal self-stabilizing multi-token ring: a randomized solution

Proceedings of the 28th ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown that Dijkstra's k-state self-stabilizing protocol for mutual exclusion in a unidirectional ring can be converted to a 3-state protocol by replacing a counter with a random number generator.