Toward a non-atomic era: l-exclusion as a test case
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Introduction to distributed algorithms
Introduction to distributed algorithms
k-Arbiter: a safe and general scheme for h-out of-k mutual exclusion
Theoretical Computer Science
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Space and time efficient self-stabilizing l-exclusion in tree networks
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
A Distributed Solution to the k-out of-M Resources Allocation Problem
ICCI '91 Proceedings of the International Conference on Computing and Information: Advances in Computing and Information
A New Efficient Tool for the Design of Self-Stabilizing l-Exclusion Algorithms: The Controller
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Self-Stabilizing Network Orientation Algorithms In Arbitrary Rooted Networks
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
(h-k)-arbiter for h-out of-k Mutual Exclusion Problem
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Self-stabilizing multi-token rings
Distributed Computing
Self-stabilization over unreliable communication media
Distributed Computing - Special issue: Self-stabilization
A new self-stabilizing k-out-of-l exclusion algorithm on rings
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
| Hi-index | 0.00 |
In this paper, we present the first self-stabilizing solution to the k out of l exclusion problem [14] on a ring. The k out of l exclusion problem is a generalization of the well-known mutual exclusion problem -- there are l units of the shared resources, any process can request some number k (1 驴 k 驴 l) of units of the shared resources, and no resource unit is allocated to more than one process at one time. The space requirement of the proposed algorithm is independent of l for all processors except a special processor, called Root. The stabilization time of the algorithm is only 5n, where n is the size of the ring.