Group mutual exclusion in tree networks

Journal of Information Science and Engineering

Volumn 19, Issue 3, 2003, Pages 415-432

  Beauquir, Joffroy ^a   Cantarell, Sébastien ^a   Datta, Ajoy K ^b   Petit, Franck ^c  

^a CNRS   (France)

^b UNIVERSITY OF NEVADA   (United States)

^c NONE

Author keywords

Group mutual exclusion; Mutual exclusion; Priority based; Readers writers problem; Resource allocation

Indexed keywords

COMPUTATIONAL COMPLEXITY; RESOURCE ALLOCATION; SWITCHING NETWORKS; TREES (MATHEMATICS);

GROUP MUTUAL EXCLUSION;

TELECOMMUNICATION NETWORKS;

EID: 0038030915     PISSN: 10162364     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (15)

1. Y.-J. Joung, "Asynchronous group mutual exclusion," Distributed Computing, Vol. 13, 2000, pp. 189-206.
2. E. W. Dijkstra, "Solution to a problem in concurrent programming control," Communications of the Association of the Computing Machinery, Vol. 89, 1965, pp. 569.
3. L. Lamport, "The mutual exclusion problem: Part ii - statement and solutions," Journal of the Association of the Computing Machinery, Vol. 33, 1986, pp. 327-348.
4. P. J. Courtois, F. Heymans, and D. L. Parnas, "Concurrent control with readers and writers," Communications of the Association of the Computing Machinery, Vol. 14, 1971, pp. 667-668.
5. E. W. Dijkstra, "Hierarchical ordering of sequential processes," Acta Information, Vol. 1, 1971, pp. 115-138.
6. K. M. Chandy and J. Misra, "The drinking philosophers problem," ACM Transactions on Programming Languages and Systems, Vol. 6, 1984, pp. 632-646.
7. M. Fisher, N. Lynch, J. Burns, and A. Borodin, "Distributed FIFO allocation of identical resourses using small shared space," ACM Transactions on Programming Languages and Systems, Vol. 11, 1989, pp. 91-104.
8. P. Keane and M. Moir, "A simple local-spin group mutual exclusion algorithm," in Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing (PODC '99), 1999, pp. 23-32.
9. V. Hadzilacos, "A note on group mutual exclusion," in PODC01 Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001, pp. 100-106.
10. Y.-J. Joung, "The congenial talking philosophers problem in computer networks," Distributed Computing, Vol. 15, 2002, pp. 155-175.
11. K.-P. Wu and Y.-J. Joung, "Asynchronous group mutual exclusion in ring networks," in Proceedings of the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing (IPPS/SPDP '99), 1999, pp. 539-543.
12. S. Cantarell, A. K. Datta, F. Petit, and V. Villain, "Group mutual exclusion in token rings," in the 8th International Colloquium on Structural Information and Communication Complexity Proceedings, 2001, pp. 61-76.
13. K. Raymond, "A tree-base algorithm for distributed mutual exclusion," ACM Transaction on Computer Systems, Vol. 7, 1989, pp. 61-77.
14. E J H Chang, "Echo algorithms: depth parallel operations on general graphs," IEEE Transactions on Software Engineering, Vol. SE-8, 1982, pp. 391-401.
15. A Segall, "Distributed network protocols," IEEE Transactions on Information Theory, Vol. IT-29, 1983, pp. 23-35.