A log (N) distributed mutual exclusion algorithm based on path reversal

Journal of Parallel and Distributed Computing

Volumn 34, Issue 1, 1996, Pages 1-13

  Naimi, Mohamed ^a   Trehel, Michel ^a   Arnold, André ^b  

^a UNIVERSITÉ DE FRANCHE COMTÉ   (France)

^b UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030577965     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1996.0041     Document Type: Article

References (27)

1. 1. A. Arnold, M. P. Delest, and S. Dulucq, Complexité moyenne de l'algorithme d'exclusion mutuelle de Naimi-Tréhel. Tech. Rep., UER de mathématique et informatique, Université de Bordeaux-1, 1987.
2. 2. C. Berge, Théorie des graphes et ses applications, Dunod, Paris, 1967.
3. 3. J. Berstel, Transductions and Context-Free Languages. Teubner, Stuttgart, 1979.
4. 4. O. Carvalho and G. Roucairol, On mutual exclusion in computer networks, Comm. ACM 26, 2 (Feb. 1983), 146-147.
5. 5. A. Bouabdallah and M. Tréhel, A characterization of the dynamical ascending routing. Proc. of the Workshop on the Future Trends of Distributed Computing Systems in the 1990's, Hong Kong, Sept. 1988, pp. 237-244.
6. 6. M. Chandy, J. Misra, The drinking philosopher problem. ACM Trans. Parallel Languages and Systems 6, 4 (Oct. 1984), 632-646.
7. 7. L. Chottin, Etude syntaxique de certains langages solutions d'équations avec opérateurs. Theor. Comput. Sci. 5 (1977), 51-84.
8. 8. R. Cori, J. Richard, Enumération des graphes planaires à l'aide des séries formelles en variables non commutatives. Discrete Math. 2 (1972).
9. 9. E. W. Dijkstra, Self-stabilizing systems in spite of distributed control. Comm. ACM 17, 11 (Nov. 1974), 643-644.
10. 10. S. Dulucq, Equations avec opérateurs: Un outil combinatoire. Thése de 3ème cycle, Bordeaux, 1981.
11. 11. M. Fouzi, M. Trehel, A distributed algorithm for mutual exclusion using distributed structures in an arbitrary network. IFIP, Network Information Processing System, Sofia, May 1988.
12. 12. H. Garcia-Molina, Elections in a distributed computing system. IEEE Trans. Comm. C-31 (Jan. 1982), 48-59.
13. 13. D. Ginat and A. U. Shankar, An assertional proof of correctness and serializability of a distributed mutual exclusion algorithm based on path reversal. UNIACS-TR-88-65 CS-TR-2104, (Sept. 1988).
14. 14. D. Ginat, D. D. Sleator, R. E. Tarjan, A tight amortized bound for path reversal. Inform. Process. Lett. 31 (1989), 3-5.
15. 15. J. Hardouin-Duparc, Maxima limites d'une caractéristique de certaines transformations d'arborescences. Tech. Rep., Lab. Inf., Univ. de Besançon, France, May 1987.
16. 16. D. E. Knuth, The Art of Computer Programming, Vol. 1. Addison-Wesley, Reading, MA, 1973.
17. 17. L. Lamport, Time, clocks and the ordering of events in a distributed system. Comm. ACM 21, 7 (1978), 558-565.
18. 18. G. Le Lann, Distributed systems, towards a formal approach. IFIP Congress, Toronto, Aug. 1977, pp. 155-160.
19. 19. M. Maekawa, "A √n algorithm for mutual exclusion in decentralized systems. ACM Trans. Comput. Systems 3, 2 (May 1985), 145-159.
20. 20. M. Naimi Une structure arborescente pour une classe d'algorithmes d'exclusion mutuelle. Ph.D. Thesis University of Besançon, France, Mar. 1987.
21. 21. G. Ricart and A. Agrawala, An optimal algorithm for mutual exclusion in computer networks. Comm. ACM 24, 1 (Jan. 1981), 9-17.
22. 22. G. Ricart and A. Agrawala, Author's response to "On mutual exclusion in computer networks" by Carvalho and Roucairol. Comm. ACM 26, 2 (Feb. 1983). 147-148.
23. 23. I. Suzuki and T. Kasami, An optimality theory for mutual exclusion networks, Proc. of the 3rd Int. Conf. on Distributed Computing Systems. Miami, Oct. 1982, pp. 365-370.
24. 24. M. Tréhel, M. Naimi, Un algorithme distribué d'exclusion mutuelle en Log(n). TSI 6, 2 (1987), 141-150.
25. 25. M. Tréhel, M. Naimi, A distributed algorithm for mutual exclusion based on data structures and fault tolerance. 6th Annual International Phoenix Conference on Computers and Communications, Scottsdale, AZ, Feb. 1987, pp. 35-39.
26. n liées à des transformations d'arborescences. Tech. Rep., Lab. Inf., Univ. de Besançon, France, Sep. 1986.
27. 27. R. S. Varga, Matrix Iterative Analysis. Prentice-Hall, Englewood Cliffs, NJ, 1962.