Parallel program design: a foundation
Parallel program design: a foundation
Toward a non-atomic era: l-exclusion as a test case
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
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
ACM Computing Surveys (CSUR)
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Memory space requirements for self-stabilizing leader election protocols
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Self-stabilizing systems in spite of distributed control
Communications of the ACM
A Bounded First-In, First-Enabled Solution to the 1-Exclusion Problem
WDAG '90 Proceedings of the 4th International Workshop on Distributed Algorithms
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
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
Distributed Computing
Self-stabilizing multi-token rings
Distributed Computing
Resource allocation with immunity to limited process failure
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Hi-index | 0.00 |
Abstract: A self-stabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate without the need for explicit exception handler of backward recovery. The l-mutual exclusion is a generalization of the fundamental problem of mutual exclusion: the system has to guarantee the fair sharing of a resource that can be used by l processors simultaneously. We present a space efficient solution to the l-mutual exclusion problem that performs on uniform unidirectional ring networks and that is self-stabilizing. Our solution improves the space complexity of previously known approaches by a factor of \min(n^2\times \log(n), 1\over l\times \log^{l-1}(n)), while retaining none of their drawbacks in terms of system hypothesis (we support unfair scheduler and ensure strong correctness) or specification verification (we guarantee high level l-mutual exclusion). When l is fixed, the space complexity at each node is constant in average, making our approach suitable for scalable systems. Extensive proofs can be found in [15].