Space and time efficient self-stabilizing and l-exclusion in tree networks

We propose a very efficient self-stabilizing l-exclusion algorithm in rooted tree networks. The l-exclusion problem is a generalization of the mutual exclusion problem-we allow l (l/spl ges/1) processors, instead of 1, to use a shared resource. The algorithm is semi-uniform and its space requirement is (l+3)/spl Delta//sub r/ states (or [log((l+3)/spl Delta//sub r/)] bits) for the root r, 3/spl Delta//sub p/ states (or [log(3/spl Delta//sub p/)] bits) for an internal processor p, and 2 states (or 1 bit) for a leaf processor, where /spl Delta//sub p/ is the degree of processor p. Our algorithm is unique in the sense that this is the first l-exclusion algorithm on trees, whose space requirement is independent of the size of the network for any processor and is independent of l for all processors except the root.

[1]  Amos Israeli,et al.  Uniform Dynamic Self-Stabilizing Leader Election , 1997, IEEE Trans. Parallel Distributed Syst..

[2]  Nir Shavit,et al.  A bounded first-in, first-enabled solution to the l-exclusion problem , 1994, TOPL.

[3]  Vincent Villain,et al.  A Key Tool for Optimality in the State Model , 1999, WDAS.

[4]  Shlomi Dolev,et al.  Self-stabilizing l-exclusion , 2001, Theor. Comput. Sci..

[5]  Nir Shavit,et al.  Toward a non-atomic era: l-exclusion as a test case , 1988, STOC '88.

[6]  Ajoy Kumar Datta,et al.  State-optimal snap-stabilizing PIF in tree networks , 1999, Proceedings 19th IEEE International Conference on Distributed Computing Systems.

[7]  Mohamed G. Gouda,et al.  The Stabilizing Token Ring in Three Bits , 1996, J. Parallel Distributed Comput..

[8]  Allan Borodin,et al.  Distributed FIFO allocation of identical resources using small shared space , 1985, TOPL.

[9]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[10]  Danny Dolev,et al.  A Bounded First-In, First-Enabled Solution to the 1-Exclusion Problem , 1990, WDAG.

[11]  Rachid Hadid Space and Time Efficient Self-Stabilizing l-Exclusion in Tree Networks , 2002, J. Parallel Distributed Comput..

[12]  Allan Borodin,et al.  Resource allocation with immunity to limited process failure , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).