Group mutual exclusion in token rings

Computer Journal

Volumn 48, Issue 2, 2005, Pages 239-252

  Cantarell, Sébastien ^a   Datta, Ajoy K ^b   Petit, Franck ^c   Villain, Vincent ^c  

^a CNRS   (France)

^b UNIVERSITY OF NEVADA   (United States)

^c UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STORAGE EQUIPMENT; INTERNET; MATHEMATICAL MODELS; NETWORK PROTOCOLS; QUALITY OF SERVICE; SERVERS;

GROUP MUTUAL EXCLUSION PROBLEM; TOKEN RING NETWORKS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 15744369039     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/bxh077     Document Type: Article

References (12)

1. Keane, P. and Moir, M. (1999) A simple local-spin group mutual exclusion algorithm. In: Proc. 18th Annual ACM Symp. on Principles of Distributed Computing (PODC'99), Atlanta, Georgia, USA, May 3-6, pp. 23-32. ACM Press.
2. Joung, Y.-J. (1998) Asynchronous group mutual exclusion (extended abstract). In: Proc. 17th Annual ACM Symp. on Principles of Distributed Computing (PDOC), Puerto Vallarta, Mexico, June 28-July 2, pp. 51-60. ACM Press.
3. Dijkstra, E. (1965) Solution to a problem in concurrent programming control. Commun. ACM, 8, 569.
4. Lamport, L. (1986) The mutual exclusion problem: Part ii - statement and solutions. J. ACM, 33, 327-348.
5. Courtois, P., Heymans, F. and Parnas, D. (1971) Concurrent control with readers and writers. Commun. ACM, 14, 667-668.
6. Dijkstra, E. (1971) Hierarchical ordering of sequential processes. Acta Inform., 1, 115-138.
7. Chandy, K. and Misra, J. (1984) The drinking philosophers problem. ACM Trans. Program. Lang. Syst., 6(4), 632-646.
8. Fisher, M., Lynch, N., Burns, J. and Borodin, A. (1989) Distributed FIFO allocation of identical resourses using small shared space. ACM Trans. Program. Lang. Syst., 11(1), 91-104.
9. Joung, Y.-J. (1999) The congenial talking philosophers problem in computer networks (extended abstract). In: Proc. 13th Int. Symp. on DIStributed Computing (DISC'99), Bratislava, Slavak Republic, September 27-29, LNCS: 1693, pp. 195-209. Springer-Verlag.
10. Joung, Y.-J. (2003) Quorum-based algorithms for group mutual exclusion. IEEE Trans. Parall. Distr. Syst., 14, 463-476.
11. Wu, K.-P. and Joung, Y.-J. (1999) Asynchronous group mutual exclusion in ring networks. In Proc. 13th Int. Parallel Processing Symp. and 10th Symp. on Parallel and Distributed Processing (IPPS/SPDP '99), San Juan, Puerto Rico, April 12-16, pp. 539-543. IEEE Computer Society.
12. Lamport, L. (1978) Time, clocks and the ordering of events in a distributed system. Commun. ACM, 21, 558-565.