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
Introduction to distributed algorithms
Introduction to distributed algorithms
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
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 Network Orientation Algorithms In Arbitrary Rooted Networks
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Self-stabilizing multi-token rings
Distributed Computing
Self-stabilization over unreliable communication media
Distributed Computing - Special issue: Self-stabilization
Resource allocation with immunity to limited process failure
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
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
A new self-stabilizing k-out-of-l exclusion algorithm on rings
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Topological adaptability for the distributed token circulation paradigm in faulty environment
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Universal adaptive self-stabilizing traversal scheme: Random walk and reloading wave
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
In this paper, we present the first self-stabilizing protocols for l-exclusion problem in the message passing model. The l-exclusion problem is a generalization of the mutual exclusion problem--we allow l (l 驴 1) processors, instead of 1, to use a shared resource. We propose a new technique for the design of self-stabilizing l-exclusion: the controller. This tool allows to count tokens of the system without any counter variable for all processors except one called Root. We also introduce a new protocol composition called parametric composition. Then we present protocols on rings and on trees. The space requirement of both algorithms is independent of l for all processors except Root. The stabilization time of the first protocol is 3n time, where n is the ring size and the stabilization time of the second one is 6h + 2 time, where h is the tree height.