The mutual exclusion problem: partII—statement and solutions
Journal of the ACM (JACM)
Probabilistic solitude verification on a ring
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Computing on an anonymous ring
Journal of the ACM (JACM)
On achieving consensus using a shared memory
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Uniform self-stabilizing rings
ACM Transactions on Programming Languages and Systems (TOPLAS)
Calling names in nameless networks
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
A modular technique for the design of efficient distributed leader finding algorithms
ACM Transactions on Programming Languages and Systems (TOPLAS)
Self-stabilizing extensions for message-passing systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
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
Symmetry breaking in distributed networks
Information and Computation
Distributed reset (extended abstract)
FST and TC 10 Proceedings of the tenth conference on Foundations of software technology and theoretical computer science
Self-stabilizing ring orientation
Proceedings of the 4th international workshop on Distributed algorithms
Memory-efficient self stabilizing protocols for general networks
Proceedings of the 4th international workshop on Distributed algorithms
Wait-free clock synchronization
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Uniform Dynamic Self-Stabilizing Leader Election (Extended Absrtact)
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Tight lower and upper bounds for some distributed algorithms for a complete network of processors
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Self-stabilization of dynamic systems assuming only read/write atomicity
Distributed Computing - Special issue: Self-stabilization
Uniform Dynamic Self-Stabilizing Leader Election
IEEE Transactions on Parallel and Distributed Systems
Quantitative program logic and expected time bounds in probabilistic distributed algorithms
Theoretical Computer Science
Token-based self-stabilizing uniform algorithms
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Randomized Finite-State Distributed Algorithms as Markov Chains
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Communication Adaptive Self-Stabilizing Group Membership Service
IEEE Transactions on Parallel and Distributed Systems
Self-stabilizing clock synchronization in the presence of Byzantine faults
Journal of the ACM (JACM)
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
Distributed Computing
Coupling and self-stabilization
Distributed Computing - Special issue: DISC 04
An elementary proof that Herman's ring is Θ(N2)
Information Processing Letters
Analysis of an Intentional Fault Which Is Undetectable by Local Checks under an Unfair Scheduler
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
An elementary proof that Herman's Ring is Θ(N2)
Information Processing Letters
All k-bounded policies are equivalent for self-stabilization
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Price stabilization in networks: what is an appropriate model?
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Symmetry reduction for probabilistic model checking using generic representatives
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Adversarial scheduling in discrete models of social dynamics
Mathematical Structures in Computer Science
| Hi-index | 0.01 |
In this paper we introduce a novel technique, the scheduler luck game (in short sl-game) for analyzing the performance of randomized distributed protocols. We apply it in studying uniform self-stabilizing protocols for leader election under read/write atomicity. We present two protocols for the case where each processor in the system can communicate with all other processors and analyze their performance using the sl-game technique.