Abstract
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.
Supported in part by the Pole de Modélisation de Picardie, France and the Fonds Social Européen.
Chapter PDF
Similar content being viewed by others
References
Afek, Y., Brown, G.M: Self-stabilization over unreliable communication media. Distributed Computing, Vol. 7 (1993) 27–34
Abraham, U., Dolev, S., Herman, T., Koll, I.: Self-Stabilizing l-exclusion. In Proceedings of the third Workshop on Self-Stabilizing Systems, International Informatics Series 7, Carleton University Press (1997) 48–63
Baldoni, R.: An O(N M/M+1) distributed algorithm for the k-out of-M resources allocation problem. In Proceedings of the 14th conference on Distributed Computing and System (1994) 81–85.
Datta, AK., Gurumurthy, S., Petit, F., Villain V.: Self-stabilizing network orientation algorithms in arbitrary rooted networks. In Proceedings of the 20th IEEE International Conference on Distributed Computing Systems (2000) 576–583
Datta, AK., Hadid, R., Villain V.: A Self-stabilizing Token-Based k-out-of-l Exclusion Algorithm. Technical Report RR 2002-04, LaRIA, University of Picardie Jules Verne (2002).
Dolev, D., Gafni, E., Shavit, N.: Toward a non-atomic era: l-exclusion as test case. In Proceeding of the 20th Annual ACM Symposium on Theory of Computing, Chicago (1988) 78–92
Dijkstra, EW.: Self stabilizing systems in spite of distributed control. Communications of the Association of the Computing Machinery, Vol. 17, No. 11 (1974) 643–644
Flatebo, M., Datta, AK., Schoone, AA.: Self-stabilizing multi-token rings. Distributed Computing, Vol. 8 (1994) 133–142
Hadid, R.: Space and time efficient self-stabilizing l-exclusion in tree networks. In Journal of parallel and distributed computing. To appear.
Hadid, R., Villain, V: A new efficient tool for the design of Self-stabilization l-exclusion algorithms: the controller, In Proceedings of the 5th International Workshop, WSS (2001) 136–151.
Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Communications of ACM, Vol. 21 (1978) 145–159
Manabe, Y., Tajima, N.: (h, k)-Arbiter for h-out of-k mutual exclusion problem. In Proceedings of the 19th Conference on Distributed Computing Systems, (1999) 216–223.
Manabe, Y., Baldoni, R., Raynal, M., Aoyagi, S.: k-Arbiter: A safe and general scheme for h-out of-k mutual exclusion. Theoretical Computer Science, Vol. 193 (1998) 97–112
Raynal, M.: A distributed algorithm for the k-out of-m resources allocations problem. In Proceedings of the 1st conference on Computing and Informations, Lecture Notes in Computer Science, Vol. 497 (1991) 599–609
Raynal, M.: Synchronisation et état global dans les systèmes répartis. Eyrolles, collection EDF(1992)
Tel, G.: Introduction to distributed algorithms. Cambridge University Press (1994)
Varghese G.: Self-stabilizing by counter flushing. Technical Report, Washington University (1993)
Villain V. A Key Tool for Optimality in the State Model. DIMACS Workshop on Distributed Data and Structures, Proceedings in Informatics 6, Carleton Scientific, pages 133–148, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Datta, A.K., Hadid, R., Villain, V. (2002). A Self-stabilizing Token-Based k-out-of-l Exclusion Algorithm. In: Monien, B., Feldmann, R. (eds) Euro-Par 2002 Parallel Processing. Euro-Par 2002. Lecture Notes in Computer Science, vol 2400. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45706-2_76
Download citation
DOI: https://doi.org/10.1007/3-540-45706-2_76
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44049-9
Online ISBN: 978-3-540-45706-0
eBook Packages: Springer Book Archive