Election in a complete network with a sense of direction
Information Processing Letters
Computing on an anonymous ring
Journal of the ACM (JACM)
Probabilistic self-stabilization
Information Processing Letters
Uniform self-stabilizing ring orientation
Information and Computation
Asynchronous consensus and broadcast protocols
Journal of the ACM (JACM)
Optimal elections in labeled hypercubes
Journal of Parallel and Distributed Computing
On the impact of sense of direction on message complexity
Information Processing Letters
Optimal distributed algorithms in unlabeled tori and chordal rings
Journal of Parallel and 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
A Distributed Ring Orientation Algorithm (Preliminary Version)
Proceedings of the 2nd International Workshop on Distributed Algorithms
Wang Tilings and Distributed Orientation on Anonymous Torus Networks (Extended Abstract)
WDAG '93 Proceedings of the 7th International Workshop on Distributed Algorithms
Uniform Deterministic Self-Stabilizing Ring-Orientation on Odd-Length Rings
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Sense of Direction in Processor Networks
SOFSEM '95 Proceedings of the 22nd Seminar on Current Trends in Theory and Practice of Informatics
The Triumph and Tribulation of System Stabilization
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Efficient leader election using sense of direction
Distributed Computing
Self-stabilization of dynamic systems assuming only read/write atomicity
Distributed Computing - Special issue: Self-stabilization
Naming symmetric processes using shared variables
Distributed Computing
Optimal map construction of an unknown torus
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
| Hi-index | 0.00 |
A torus is oriented if the processes have assigned their communication links North-East-South-West labels in a globally consistent manner. This paper presents an orientation protocol that is self-stabilizing, i.e., resilient to corruption of data stored in working memories and communication links. The protocol is randomized, uses constant memory space, and orients tori where the processes do not know the network size and have no identifiers; probabilistic stabilization is proved under a restricted form of asynchrony and composite atomicity.