A belated proof of self-stabilization
Distributed Computing
Uniform self-stabilizing rings
ACM Transactions on Programming Languages and Systems (TOPLAS)
Token Systems That Self-Stabilize
IEEE Transactions on Computers
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 symmetry breaking in constant-space (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Uniform and Self-Stabilizing Token Rings Allowing Unfair Daemon
IEEE Transactions on Parallel and Distributed Systems
Memory space requirements for self-stabilizing leader election protocols
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Self-stabilizing algorithms for synchronous unidirectional rings
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
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
Self-stabilizing extensions for message-passing systems
Distributed Computing - Special issue: Self-stabilization
Token-based self-stabilizing uniform algorithms
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
An elementary proof that Herman's ring is Θ(N2)
Information Processing Letters
An elementary proof that Herman's Ring is Θ(N2)
Information Processing Letters
| Hi-index | 0.00 |
In [2], J. Beauquier, M. Gradinariu and C. Johnen presented a probabilistic self-stabilizing token circulation algorithm for asynchronous uniform unidirectional rings. This paper provides an improvement on this algorithm. It also computes the (message) complexity of the stabilization period of the original algorithm, which is &THgr;(N3), and the improved version, which is &THgr;(N2 log N), where N is the number of processes plus the number of messages in transit. Such algorithms are mostly used for mutual exclusion.