### A stabilizing l-exclusion algorithm in arbitrary rooted networks

#### Abstract

#### Keywords

#### Full Text:

PDF#### References

Abraham, U., Dolev, S., Herman, T., and Koll, I. (1997). Self-stabilizing `-exclusion. In

Proceedings of the Third Workshop on Self-Stabilizing Systems, Carleton University Press,

pages 48-63.

Abraham, U., Dolev, S., Herman, T., and Koll, I. (2001). Self-stabilizing `-exclusion. Theo-

retical Computer Science, 266:1-2:653-692.

Afek, Y., Dolev, D., Gafni, E., Merritt, M., and Shavit, N. (1990). A bounded rst-in, rst-

enabled solution to the `-exclusion problem. Proceedings of the 4th International Workshop

on Distributed Algorithms, Springer-Verlag, LNCS, 486:422-431.

Antonoiu, G. and Srimani, P. (2000). Self-stabilizing depth-rst multi-token circulation in tree

networks. International Journal of Parallel, Emergent and Distributed Systems, 16:1:17-35.

Bernard, T., Bui, A., Flauzac, O., and Nolot, F. (2010). A multiple random walks based

self-stabilizing k-exclusion algorithm in ad-hoc networks. International Journal of Parallel,

Emergent and Distributed Systems, Taylor Francis eds, 25:2:135-152.

Cournier, A., Datta, A., Petit, F., and Villain, V. (2002). Self-stabilizing pif algorithm in

arbitrary rooted networks. In 21st International Conference on Distributed Computing

Systems, IEEE Computer Society Press, pages 91-98.

Dijkstra, E. (1974). Self stabilizing systems in spite of distributed control. Communications

of the Association of the Computing Machinery, 17:11:643-644.

Dolev, D., Gafni, E., and Shavit, N. (1988). Toward a non-atomic era: `-exclusion as test

case. Proceeding of the 20th Annual ACM Symposium on Theory of Computing, Chicago,

pages 78-92.

Dolev, S., Israeli, A., and Moran, S. (1997). Uniform dynamic self-stabilizing leader election.

IEEE Transactions on Parallel and Distributed Systems, 8:4:420-440.

Fisher, M., Lynch, N., Burns, J., and Borondin, A. (1979). Resource allocation with immunity

to limited process failure. Proceedings of the 20th IEEE Annual Symposium on Foundations

of Computer Science, pages 234-254.

Fisher, M., Lynch, N., Burns, J., and Borondin, A. (1989). A distributed fo allocation of

identical resources using small shared space. ACM Transactions Programming Languages

Systems, 11:90-144.

Flatebo, M., Datta, A., and Schoone, A. (1994). Self-stabilizing multi-token rings. Distributed

Computing, Vol. 8, 8:133-142.

Gouda, M. and Haddix, F. (1996). The stabilizing token ring in three bits. Journal of Parallel

and Distributed Computing, 35:43-48.

Gradinariu, M. and Tixeuil, S. (2001). Tight space self-stabilizing uniform l-mutual exclusion.

Distributed Computing, Vol. 7, pages 83-90.

Hadid, R. (2000). Space and time ecient self-stabilizing `-exclusion in tree networks. Pro-

ceedings of the 14th IEEE International Parallel and Distributed Processing Symposium,

pages 529-534.

Hadid, R. (2002). Space and time ecient self-stabilizing `-exclusion in tree networks. Journal

of Parallel and Distributed Computing, 62(5):843{864.

Hadid, R. and Villain, V. (2001). A new ecient tool for the design of self-stabilizing `-

exclusion algorithms : the controller. In Proceedings of the 5th IEEE International Work-

shop, WSS, pages 137-151.

Masum, S., Akbar, M., Ali, A., and Rahman, M. (2010). A consensus-based `-exclusion

algorithm for mobile ad hoc networks. Ad Hoc Networks Journal, 8:30-45.

Peterson, G. (1990). Observation on `-exclusion. Proceedings of the 28th Annual Allerton

Conference on Communication, Control and computing, Monticello, pages 568-577.

Villain, V. (1999). A key tool for optimality in the state model. In DIMACS'99, The 2nd

Workshop on Distributed Data and Structures, Carleton University Press, pages 133-148.

### Refbacks

- There are currently no refbacks.