Distributed FIFO allocation of identical resources using small shared space
ACM Transactions on Programming Languages and Systems (TOPLAS)
Toward a non-atomic era: l-exclusion as a test case
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A bound first-in, first-enabled solution to the 1-exclusion problem
Proceedings of the 4th international workshop on Distributed algorithms
The stabilizing token ring in three bits
Journal of Parallel and Distributed Computing
Uniform Dynamic Self-Stabilizing Leader Election
IEEE Transactions on Parallel and Distributed Systems
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Theoretical Computer Science
Two-State Self-Stabilizing Algorithms for Token Rings
IEEE Transactions on Software Engineering
State-optimal snap-stabilizing PIF in tree networks
ICDCS '99 Workshop on Self-stabilizing Systems
Space and Time Efficient Self-Stabilizing ?-Exclusion in Tree Networks
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Self-stabilizing multi-token rings
Distributed Computing
Self-stabilization of dynamic systems assuming only read/write atomicity
Distributed Computing - Special issue: Self-stabilization
A Self-stabilizing Token-Based k-out-of-l Exclusion Algorithm
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
| Hi-index | 0.00 |
We propose an efficient self-stabilizing l-exclusion algorithm in rooted tree networks running under an unfair distributed daemon. The l-exclusion problem is a generalization of the mutual exclusion problem--l (l≥1) processors, instead of 1, are permitted to use a shared resource. The algorithm is semi-uniform and its space requirement is (l + 3)Δr states (or ⌈log((l + 3)Δr)⌉ bits) for the root r, 4(Δp - 1) states (or ⌈2log(Δp - 1)⌉ bits) for an internal processor p, and 3 states (or 2 bits) for a leaf processor, where Δp is the degree of processor p. This is the first l-exclusion algorithm on trees with the property that the space requirement is independent of the size of the network for any processor, and is independent of l for all processors except the root. The stabilization time of the algorithm is only O(l + h) rounds, where h is the height of the tree.