A belated proof of self-stabilization
Distributed Computing
Uniform self-stabilizing rings
ACM Transactions on Programming Languages and Systems (TOPLAS)
The bit complexity of randomized leader election on a ring
SIAM Journal on Computing
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Leader election in uniform rings
ACM Transactions on Programming Languages and Systems (TOPLAS)
The stabilizing token ring in three bits
Journal of Parallel and Distributed Computing
Memory requirements for silent stabilization
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Memory space requirements for self-stabilizing leader election protocols
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Self-stabilization
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Distributed Algorithms
Deterministic, Constant Space, Self-Stabilizing Leader Election on Uniform Rings
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Cross-Over Composition - Enforcement of Fairness under Unfair Adversary
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Cross-Over Composition - Enforcement of Fairness under Unfair Adversary
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Self-Stabilizing Anonymous Leader Election in a Tree
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8 - Volume 09
Brief announcement: deterministic self-stabilizing leader election with O(log log n)-bits
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
A new, self-stabilizing algorithm for electing a leader on a unidirectional ring of prime size is presented for the composite atomicity model with a centralized daemon. Its space complexity is optimal to within a small additive constant number of bits per processor, significantly improving previous self-stabilizing algorithms for this problem. In other models or when the ring size is composite, no deterministic solutions exist, because it is impossible to break symmetry.