Parallel program design: a foundation
Parallel program design: a foundation
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
Memory-efficient and self-stabilizing network RESET (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Uniform and Self-Stabilizing Token Rings Allowing Unfair Daemon
IEEE Transactions on Parallel and Distributed Systems
Uniform Dynamic Self-Stabilizing Leader Election
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 token circulation on asynchronous uniform unidirectional rings
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Randomized uniform self-stabilizing mutual exclusion
Information Processing Letters
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Analyzing Expected Time by Scheduler-Luck Games
IEEE Transactions on Software Engineering
Probabilistic Simulations for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
Composition and Behaviors of Probabilistic I/O Automata
CONCUR '94 Proceedings of the Concurrency Theory
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Self-Stabilizing Mutual Exclusion Using Unfair Distributed Scheduler
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Self-stabilizing mutual exclusion on directed graphs
Self-stabilizing mutual exclusion on directed graphs
Self-stabilization of dynamic systems assuming only read/write atomicity
Distributed Computing - Special issue: Self-stabilization
Randomized dining philosophers without fairness assumption
Distributed Computing
An autonomic election algorithm based on emergence in natural systems
Integrated Computer-Aided Engineering - Autonomous Computing
Self-stabilizing group communication in directed networks
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
| Hi-index | 0.00 |
This work focuses on self-stabilizing algorithms for mutual exclusion and leader election--two fundamental tasks for distributed systems. Self-stabilizing systems are able to recover by themselves, regaining their consistency from any initial or intermediary faulty configuration. The proposed algorithms are designed for any directed, anonymous network and stabilize under any distributed scheduler. The keystones of the algorithms are the token management and routing policies. In order to break the network symmetry, randomization is used. The space complexity is O((D+ + D-)(log(snd(n)) + 2)) where n is the network size, snd(n) is the smallest integer that does not divide n and D+ and D- are the maximal out and in degree, respectively. It should be noted that snd(n) is constant on the average and equals 2 on odd-size networks.